Base | Representation |
---|---|
bin | 100101011000011011011111… |
… | …011010100111000100011001 |
3 | 210120010002221010000002022220 |
4 | 211120123133122213010121 |
5 | 133022114011122414400 |
6 | 1341355150103134253 |
7 | 46425656331126513 |
oct | 4530333732470431 |
9 | 716102833002286 |
10 | 164406506451225 |
11 | 48426453906365 |
12 | 165330ba444389 |
13 | 709760c0ca51c |
14 | 2c85462c10bb3 |
15 | 14018cd04d7a0 |
hex | 9586df6a7119 |
164406506451225 has 96 divisors (see below), whose sum is σ = 282082450710528. Its totient is φ = 84403502400000.
The previous prime is 164406506451217. The next prime is 164406506451227. The reversal of 164406506451225 is 522154605604461.
It is not a de Polignac number, because 164406506451225 - 23 = 164406506451217 is a prime.
It is a super-3 number, since 3×1644065064512253 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (164406506451227) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 525858700 + ... + 526171250.
It is an arithmetic number, because the mean of its divisors is an integer number (2938358861568).
Almost surely, 2164406506451225 is an apocalyptic number.
164406506451225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
164406506451225 is a deficient number, since it is larger than the sum of its proper divisors (117675944259303).
164406506451225 is a wasteful number, since it uses less digits than its factorization.
164406506451225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313799 (or 313794 counting only the distinct ones).
The product of its (nonzero) digits is 6912000, while the sum is 51.
The spelling of 164406506451225 in words is "one hundred sixty-four trillion, four hundred six billion, five hundred six million, four hundred fifty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •