Base | Representation |
---|---|
bin | 1110100110100011101001… |
… | …0001001011111111110100 |
3 | 2002211220012221202100212220 |
4 | 3221220322101023333310 |
5 | 4101023244211232224 |
6 | 54051454102042340 |
7 | 3244655606414325 |
oct | 351507221137764 |
9 | 62756187670786 |
10 | 16055565336564 |
11 | 5130144079226 |
12 | 19738144193b0 |
13 | 8c60582669a0 |
14 | 3d714483244c |
15 | 1cc997149279 |
hex | e9a3a44bff4 |
16055565336564 has 192 divisors, whose sum is σ = 43175756574720. Its totient is φ = 4602225600000.
The previous prime is 16055565336557. The next prime is 16055565336581. The reversal of 16055565336564 is 46563356555061.
It is a junction number, because it is equal to n+sod(n) for n = 16055565336498 and 16055565336507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 858990459 + ... + 859009149.
It is an arithmetic number, because the mean of its divisors is an integer number (224873732160).
Almost surely, 216055565336564 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16055565336564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21587878287360).
16055565336564 is an abundant number, since it is smaller than the sum of its proper divisors (27120191238156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16055565336564 is a wasteful number, since it uses less digits than its factorization.
16055565336564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23542 (or 23540 counting only the distinct ones).
The product of its (nonzero) digits is 145800000, while the sum is 60.
The spelling of 16055565336564 in words is "sixteen trillion, fifty-five billion, five hundred sixty-five million, three hundred thirty-six thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •