Base | Representation |
---|---|
bin | 11001000001000000001110… |
… | …010010100100001001011010 |
3 | 112102112211011110122101122210 |
4 | 121001000032102210021122 |
5 | 103410032202213031020 |
6 | 1025554314000055550 |
7 | 32113456120643463 |
oct | 3101001622441132 |
9 | 472484143571583 |
10 | 110020122002010 |
11 | 320682a9719120 |
12 | 1040a7783045b6 |
13 | 4950b1202431c |
14 | 1d25006503d6a |
15 | cabd2102c3e0 |
hex | 64100e4a425a |
110020122002010 has 256 divisors, whose sum is σ = 297217708992000. Its totient is φ = 25838498611200.
The previous prime is 110020122001991. The next prime is 110020122002047. The reversal of 110020122002010 is 10200221020011.
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, 460314016 + ... + 460552964.
It is an arithmetic number, because the mean of its divisors is an integer number (1161006675750).
Almost surely, 2110020122002010 is an apocalyptic number.
110020122002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 110020122002010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148608854496000).
110020122002010 is an abundant number, since it is smaller than the sum of its proper divisors (187197586989990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110020122002010 is a wasteful number, since it uses less digits than its factorization.
110020122002010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239377.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110020122002010 its reverse (10200221020011), we get a palindrome (120220343022021).
The spelling of 110020122002010 in words is "one hundred ten trillion, twenty billion, one hundred twenty-two million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •