Base | Representation |
---|---|
bin | 1001000110000101000111… |
… | …01100100100101101110110 |
3 | 2121210222210100011102221210 |
4 | 10203002203230210231312 |
5 | 10110140213202213420 |
6 | 110311531531422250 |
7 | 4132650320614113 |
oct | 443024354445566 |
9 | 77728710142853 |
10 | 20000114101110 |
11 | 641100100a980 |
12 | 22b01a58b4986 |
13 | b21005b239a0 |
14 | 4d202147d90a |
15 | 24a3aedc39e0 |
hex | 1230a3b24b76 |
20000114101110 has 256 divisors, whose sum is σ = 56512727792640. Its totient is φ = 4465974528000.
The previous prime is 20000114101087. The next prime is 20000114101127. The reversal of 20000114101110 is 1110141100002.
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, 5392317936 + ... + 5392321644.
It is an arithmetic number, because the mean of its divisors is an integer number (220752842940).
Almost surely, 220000114101110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20000114101110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28256363896320).
20000114101110 is an abundant number, since it is smaller than the sum of its proper divisors (36512613691530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000114101110 is a wasteful number, since it uses less digits than its factorization.
20000114101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6095.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20000114101110 its reverse (1110141100002), we get a palindrome (21110255201112).
The spelling of 20000114101110 in words is "twenty trillion, one hundred fourteen million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •