Base | Representation |
---|---|
bin | 1110111101110101100001… |
… | …1100110100010011000010 |
3 | 2011021010112100021020211220 |
4 | 3233131120130310103002 |
5 | 4124101332414111401 |
6 | 54555315400215510 |
7 | 3315604502160051 |
oct | 357353034642302 |
9 | 64233470236756 |
10 | 16455503660226 |
11 | 5274815905244 |
12 | 1a1922aa6a596 |
13 | 924993b8c047 |
14 | 40c64473c398 |
15 | 1d80a340d336 |
hex | ef7587344c2 |
16455503660226 has 16 divisors (see below), whose sum is σ = 32922757088928. Its totient is φ = 5483209592000.
The previous prime is 16455503660221. The next prime is 16455503660237. The reversal of 16455503660226 is 62206630555461.
It is a super-2 number, since 2×164555036602262 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (16455503660221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489555480 + ... + 489589091.
It is an arithmetic number, because the mean of its divisors is an integer number (2057672318058).
Almost surely, 216455503660226 is an apocalyptic number.
16455503660226 is an abundant number, since it is smaller than the sum of its proper divisors (16467253428702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16455503660226 is a wasteful number, since it uses less digits than its factorization.
16455503660226 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979147377.
The product of its (nonzero) digits is 7776000, while the sum is 51.
The spelling of 16455503660226 in words is "sixteen trillion, four hundred fifty-five billion, five hundred three million, six hundred sixty thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •