Base | Representation |
---|---|
bin | 1110100110100010001010… |
… | …1111011101101011010000 |
3 | 2002211212012110000200201001 |
4 | 3221220202233131223100 |
5 | 4101021442134320422 |
6 | 54051351001551344 |
7 | 3244643044366441 |
oct | 351504257355320 |
9 | 62755173020631 |
10 | 16055170620112 |
11 | 512aa61291988 |
12 | 19737241a5554 |
13 | 8c5cc4555260 |
14 | 3d71082452c8 |
15 | 1cc97267b227 |
hex | e9a22bddad0 |
16055170620112 has 160 divisors (see below), whose sum is σ = 34521279496704. Its totient is φ = 7187114188800.
The previous prime is 16055170620107. The next prime is 16055170620131. The reversal of 16055170620112 is 21102607155061.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 969448312 + ... + 969464872.
Almost surely, 216055170620112 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 16055170620112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17260639748352).
16055170620112 is an abundant number, since it is smaller than the sum of its proper divisors (18466108876592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16055170620112 is a wasteful number, since it uses less digits than its factorization.
16055170620112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17517 (or 17511 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 37.
Adding to 16055170620112 its reverse (21102607155061), we get a palindrome (37157777775173).
The spelling of 16055170620112 in words is "sixteen trillion, fifty-five billion, one hundred seventy million, six hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •