Base | Representation |
---|---|
bin | 1001001011111010010000… |
… | …0010000000010111011110 |
3 | 1022202120102201000221102002 |
4 | 2102332210002000113132 |
5 | 2310440222321231420 |
6 | 33251551013402302 |
7 | 2061500604223025 |
oct | 222764402002736 |
9 | 38676381027362 |
10 | 10100220102110 |
11 | 324452aa32096 |
12 | 11715a7339392 |
13 | 5835a643cca8 |
14 | 26cbd34c58bc |
15 | 127ae3658075 |
hex | 92fa40805de |
10100220102110 has 64 divisors (see below), whose sum is σ = 19317262060800. Its totient is φ = 3791554041600.
The previous prime is 10100220102107. The next prime is 10100220102127. The reversal of 10100220102110 is 1120102200101.
It is a super-2 number, since 2×101002201021102 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10100220102091 and 10100220102100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13805825 + ... + 14518995.
It is an arithmetic number, because the mean of its divisors is an integer number (301832219700).
Almost surely, 210100220102110 is an apocalyptic number.
10100220102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100220102110 is a deficient number, since it is larger than the sum of its proper divisors (9217041958690).
10100220102110 is a wasteful number, since it uses less digits than its factorization.
10100220102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 713897.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10100220102110 its reverse (1120102200101), we get a palindrome (11220322302211).
The spelling of 10100220102110 in words is "ten trillion, one hundred billion, two hundred twenty million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •