Base | Representation |
---|---|
bin | 10110110000101001011001… |
… | …101010011111010010101110 |
3 | 111010102110121221202011201210 |
4 | 112300221121222133102232 |
5 | 101110014311100023042 |
6 | 552521151041215250 |
7 | 30040662421101660 |
oct | 2660513152372256 |
9 | 433373557664653 |
10 | 100100012111022 |
11 | 299931a4264490 |
12 | b288077631526 |
13 | 43b1510306071 |
14 | 1aa0c1b706530 |
15 | b88c6eaeca9c |
hex | 5b0a59a9f4ae |
100100012111022 has 256 divisors, whose sum is σ = 253849249382400. Its totient is φ = 25561499520000.
The previous prime is 100100012111009. The next prime is 100100012111051. The reversal of 100100012111022 is 220111210001001.
It is a junction number, because it is equal to n+sod(n) for n = 100100012110989 and 100100012111007.
It is a congruent number.
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, 5071169629 + ... + 5071189367.
It is an arithmetic number, because the mean of its divisors is an integer number (991598630400).
Almost surely, 2100100012111022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 100100012111022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126924624691200).
100100012111022 is an abundant number, since it is smaller than the sum of its proper divisors (153749237271378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100100012111022 is a wasteful number, since it uses less digits than its factorization.
100100012111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20623.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100100012111022 its reverse (220111210001001), we get a palindrome (320211222112023).
The spelling of 100100012111022 in words is "one hundred trillion, one hundred billion, twelve million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •