Base | Representation |
---|---|
bin | 1111000010001111001010… |
… | …1101010010010011110000 |
3 | 2011112100200012121202210012 |
4 | 3300203302231102103300 |
5 | 4131321201131102002 |
6 | 55054141343154052 |
7 | 3324222135336410 |
oct | 360436255222360 |
9 | 64470605552705 |
10 | 16531106112752 |
11 | 52a3891487870 |
12 | 1a2ba09ba5928 |
13 | 92bb51c0c25a |
14 | 41217743a640 |
15 | 1da02a7c9d52 |
hex | f08f2b524f0 |
16531106112752 has 320 divisors, whose sum is σ = 41759043154944. Its totient is φ = 6153008209920.
The previous prime is 16531106112749. The next prime is 16531106112757. The reversal of 16531106112752 is 25721160113561.
It is a happy number.
It is a super-2 number, since 2×165311061127522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16531106112757) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 955933418 + ... + 955950710.
Almost surely, 216531106112752 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 16531106112752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20879521577472).
16531106112752 is an abundant number, since it is smaller than the sum of its proper divisors (25227937042192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16531106112752 is a wasteful number, since it uses less digits than its factorization.
16531106112752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17736 (or 17730 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 41.
The spelling of 16531106112752 in words is "sixteen trillion, five hundred thirty-one billion, one hundred six million, one hundred twelve thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •