Jump to content

495 (number)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Gap9551 (talk | contribs) at 11:21, 20 July 2018 (Reverted edits by 39.53.97.71 (talk) to last version by Arthur Rubin). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

← 494 495 496 →
Cardinalfour hundred ninety-five
Ordinal495th
(four hundred ninety-fifth)
Factorization32 × 5 × 11
Greek numeralΥϞΕ´
Roman numeralCDXCV
Binary1111011112
Ternary2001003
Senary21436
Octal7578
Duodecimal35312
Hexadecimal1EF16

495 (four hundred [and] ninety-five) is the natural number following 494 and preceding 496. It is a pentatope number[1] (and so a binomial coefficient ).

Kaprekar transformation

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


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

Example

For example, choose 495:

495

The only three-digit numbers for which this function does not work are repdigits such as 111, which give the answer 0 after a single iteration. All other three-digits numbers work if leading zeros are used to keep the number of digits at 3:

211 – 112 = 099
990 – 099 = 891 (rather than 99 - 99 = 0)
981 – 189 = 792
972 – 279 = 693
963 – 369 = 594
954 − 459 = 495

The number 6174 has the same property for the four-digit numbers.

See also

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

References

  1. ^ "Sloane's A000332". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-16.
  • 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.