| ||||
---|---|---|---|---|
Cardinal | four hundred ninety-five | |||
Ordinal | 495th (four hundred ninety-fifth) | |||
Factorization | 32 × 5 × 11 | |||
Greek numeral | ΥϞΕ´ | |||
Roman numeral | CDXCV | |||
Binary | 1111011112 | |||
Ternary | 2001003 | |||
Senary | 21436 | |||
Octal | 7578 | |||
Duodecimal | 35312 | |||
Hexadecimal | 1EF16 |
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 ). The maximal number of pieces that can be obtained by cutting an annulus with 30 cuts. [2]
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.
For example, choose 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-digit numbers work if leading zeros are used to keep the number of digits at 3:
The number 6174 has the same property for the four-digit numbers, albeit has a much greater percentage of workable numbers. Sometimes these numbers (495, 6174, and their counterparts in other digit lengths or in bases other than 10) are called "Peyush constants" named after Peyush Dixit who solved this routine as a part of his IMO 2000 (International Mathematical Olympiad, Year 2000) thesis. [3]