Base | Representation |
---|---|
bin | 1001001011111101100100… |
… | …0101000111011100110010 |
3 | 1022202122201201202000201100 |
4 | 2102333121011013130302 |
5 | 2310444033142010002 |
6 | 33252215205345230 |
7 | 2061531632164152 |
oct | 222773105073462 |
9 | 38678651660640 |
10 | 10101110110002 |
11 | 324494735a1aa |
12 | 11717b5408216 |
13 | 5836b8948592 |
14 | 26cc797a0762 |
15 | 127b4685e11c |
hex | 92fd9147732 |
10101110110002 has 24 divisors (see below), whose sum is σ = 22477245021036. Its totient is φ = 3276035711136.
The previous prime is 10101110109983. The next prime is 10101110110057. The reversal of 10101110110002 is 20001101110101.
It can be written as a sum of positive squares in 2 ways, for example, as 8674091122761 + 1427018987241 = 2945181^2 + 1194579^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
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 11 ways as a sum of consecutive naturals, for example, 7583415333 + ... + 7583416664.
Almost surely, 210101110110002 is an apocalyptic number.
10101110110002 is an abundant number, since it is smaller than the sum of its proper divisors (12376134911034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101110110002 is a wasteful number, since it uses less digits than its factorization.
10101110110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15166832042 (or 15166832039 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10101110110002 its reverse (20001101110101), we get a palindrome (30102211220103).
The spelling of 10101110110002 in words is "ten trillion, one hundred one billion, one hundred ten million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •