Base | Representation |
---|---|
bin | 1001001011111101111010… |
… | …0000010000010001011110 |
3 | 1022202122222001222022101201 |
4 | 2102333132200100101132 |
5 | 2310444224441010420 |
6 | 33252232220030114 |
7 | 2061534115523455 |
oct | 222773640202136 |
9 | 38678861868351 |
10 | 10101201110110 |
11 | 3244993763a00 |
12 | 117181b99233a |
13 | 58370175a7b6 |
14 | 26cc878cbb9c |
15 | 127b4e83710a |
hex | 92fde81045e |
10101201110110 has 72 divisors (see below), whose sum is σ = 21092574226248. Its totient is φ = 3479839466400.
The previous prime is 10101201110087. The next prime is 10101201110177. The reversal of 10101201110110 is 1101110210101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 11125656 + ... + 11999275.
It is an arithmetic number, because the mean of its divisors is an integer number (292952419809).
Almost surely, 210101201110110 is an apocalyptic number.
10101201110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10101201110110 is an abundant number, since it is smaller than the sum of its proper divisors (10991373116138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101201110110 is a wasteful number, since it uses less digits than its factorization.
10101201110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23124998 (or 23124968 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 10101201110110 its reverse (1101110210101), we get a palindrome (11202311320211).
Subtracting from 10101201110110 its reverse (1101110210101), we obtain a palindrome (9000090900009).
The spelling of 10101201110110 in words is "ten trillion, one hundred one billion, two hundred one million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •