Base | Representation |
---|---|
bin | 1001001011111101100100… |
… | …1100011001110010001110 |
3 | 1022202122201212100001220002 |
4 | 2102333121030121302032 |
5 | 2310444034134120420 |
6 | 33252215314324302 |
7 | 2061531654341036 |
oct | 222773114316216 |
9 | 38678655301802 |
10 | 10101112020110 |
11 | 3244948444301 |
12 | 11717b5b89692 |
13 | 5836b9166b17 |
14 | 26cc79b3a8c6 |
15 | 127b46ada075 |
hex | 92fd9319c8e |
10101112020110 has 64 divisors (see below), whose sum is σ = 18842807131200. Its totient is φ = 3894105341952.
The previous prime is 10101112020101. The next prime is 10101112020133. The reversal of 10101112020110 is 1102021110101.
It is a junction number, because it is equal to n+sod(n) for n = 10101112020091 and 10101112020100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 547981454 + ... + 547999886.
It is an arithmetic number, because the mean of its divisors is an integer number (294418861425).
Almost surely, 210101112020110 is an apocalyptic number.
10101112020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10101112020110 is a deficient number, since it is larger than the sum of its proper divisors (8741695111090).
10101112020110 is a wasteful number, since it uses less digits than its factorization.
10101112020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21765.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10101112020110 its reverse (1102021110101), we get a palindrome (11203133130211).
It can be divided in two parts, 10101 and 112020110, that added together give a palindrome (112030211).
The spelling of 10101112020110 in words is "ten trillion, one hundred one billion, one hundred twelve million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •