Base | Representation |
---|---|
bin | 11011110000111100101111… |
… | …011111100111101111111010 |
3 | 121000100200212101022100101120 |
4 | 123300330233133213233322 |
5 | 112001131323033323002 |
6 | 1111413005142330110 |
7 | 34502141466210120 |
oct | 3360745737475772 |
9 | 530320771270346 |
10 | 122111012011002 |
11 | 359a9a97941a33 |
12 | 11841b22a29936 |
13 | 531a032a42101 |
14 | 22222c1299910 |
15 | e1b5c34d0cbc |
hex | 6f0f2f7e7bfa |
122111012011002 has 256 divisors, whose sum is σ = 292741005312000. Its totient is φ = 33234328512000.
The previous prime is 122111012010989. The next prime is 122111012011031. The reversal of 122111012011002 is 200110210111221.
It is a happy number.
It is a super-2 number, since 2×1221110120110022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9113435499 + ... + 9113448897.
It is an arithmetic number, because the mean of its divisors is an integer number (1143519552000).
Almost surely, 2122111012011002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122111012011002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146370502656000).
122111012011002 is an abundant number, since it is smaller than the sum of its proper divisors (170629993300998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122111012011002 is a wasteful number, since it uses less digits than its factorization.
122111012011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14113.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122111012011002 its reverse (200110210111221), we get a palindrome (322221222122223).
The spelling of 122111012011002 in words is "one hundred twenty-two trillion, one hundred eleven billion, twelve million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •