Base | Representation |
---|---|
bin | 1001010010111000111010… |
… | …1000010001111100011000 |
3 | 1100012000220202001222202121 |
4 | 2110232032220101330120 |
5 | 2314421301222333422 |
6 | 33423020335111024 |
7 | 2103244050452446 |
oct | 224561650217430 |
9 | 40160822058677 |
10 | 10220120121112 |
11 | 3290368408a90 |
12 | 1190889672474 |
13 | 5919a39bc3b5 |
14 | 274929443b96 |
15 | 12acae95e8c7 |
hex | 94b8ea11f18 |
10220120121112 has 256 divisors, whose sum is σ = 23487775027200. Its totient is φ = 4111810560000.
The previous prime is 10220120121073. The next prime is 10220120121137. The reversal of 10220120121112 is 21112102102201.
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, 655086112 + ... + 655101712.
It is an arithmetic number, because the mean of its divisors is an integer number (91749121200).
Almost surely, 210220120121112 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 10220120121112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11743887513600).
10220120121112 is an abundant number, since it is smaller than the sum of its proper divisors (13267654906088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220120121112 is a wasteful number, since it uses less digits than its factorization.
10220120121112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15978 (or 15974 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10220120121112 its reverse (21112102102201), we get a palindrome (31332222223313).
The spelling of 10220120121112 in words is "ten trillion, two hundred twenty billion, one hundred twenty million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •