Base | Representation |
---|---|
bin | 1001001011111101100010… |
… | …0010110010001011110010 |
3 | 1022202122201002210210001000 |
4 | 2102333120202302023302 |
5 | 2310444023341010002 |
6 | 33252214244422430 |
7 | 2061531462531120 |
oct | 222773042621362 |
9 | 38678632723030 |
10 | 10101101110002 |
11 | 3244942272391 |
12 | 11717b23a7a16 |
13 | 5836b6b16c36 |
14 | 26cc784da910 |
15 | 127b45b8261c |
hex | 92fd88b22f2 |
10101101110002 has 32 divisors (see below), whose sum is σ = 25653590121600. Its totient is φ = 2886028888464.
The previous prime is 10101101109997. The next prime is 10101101110027. The reversal of 10101101110002 is 20001110110101.
10101101110002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13361244477 + ... + 13361245232.
It is an arithmetic number, because the mean of its divisors is an integer number (801674691300).
Almost surely, 210101101110002 is an apocalyptic number.
10101101110002 is an abundant number, since it is smaller than the sum of its proper divisors (15552489011598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101101110002 is a wasteful number, since it uses less digits than its factorization.
10101101110002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26722489727 (or 26722489721 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10101101110002 its reverse (20001110110101), we get a palindrome (30102211220103).
Subtracting 10101101110002 from its reverse (20001110110101), we obtain a palindrome (9900009000099).
The spelling of 10101101110002 in words is "ten trillion, one hundred one billion, one hundred one million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •