495 (number)

← 494 495 496 →
Cardinalfour hundred ninety-five
Ordinal495th
(four hundred ninety-fifth)
Factorization32 × 5 × 11
Divisors1, 3, 5, 9, 11, 15, 33, 45, 55, 99, 165, 495
Greek numeralΥϞΕ´
Roman numeralCDXCV, cdxcv
Binary1111011112
Ternary2001003
Senary21436
Octal7578
Duodecimal35312
Hexadecimal1EF16

495 (four hundred [and] ninety-five) is the natural number following 494 and preceding 496.

Mathematics

Kaprekar's routine

The Kaprekar's routine algorithm is defined as follows for three-digit numbers:

  1. Take any three-digit number, other than repdigits such as 111. Leading zeros are allowed.
  2. Arrange the digits in descending and then in ascending order to get two three-digit numbers, adding leading zeros if necessary.
  3. Subtract the smaller number from the bigger number.
  4. Go back to step 2 and repeat.

Repeating this process will always reach 495 in a few steps. Once 495 is reached, the process stops because 954 – 459 = 495.

The number 6174 has the same property for the four-digit numbers, albeit has a much greater percentage of workable numbers.[3]

See also

  • Collatz conjecture — sequence of unarranged-digit numbers always ends with the number 1.

References

  1. ↑ Vanovschi, Vitalii. "Properties of the number 495". www.numberempire.com. Retrieved 2026-08-22.
  2. ↑ Sloane, N. J. A. (ed.). "Sequence A001318 (Generalized pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ↑ Hanover 2017, p. 14, Operations.

Sources

  • Eldridge, Klaus E.; Sagong, Seok (February 1988). "The Determination of Kaprekar Convergence and Loop Convergence of All Three-Digit Numbers". The American Mathematical Monthly. 95 (2). The American Mathematical Monthly, Vol. 95, No. 2: 105–112. doi:10.2307/2323062. JSTOR 2323062.