Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101100001100111011011 |
3 | 10220011022121001221222200 |
4 | 100000131231201213123 |
5 | 121010310041214321 |
6 | 2201200534021243 |
7 | 142321163405100 |
oct | 20003555414733 |
9 | 3804277057880 |
10 | 1100010101211 |
11 | 39456a0301aa |
12 | 1592331a7823 |
13 | 7c965c03c18 |
14 | 3b352976aa7 |
15 | 1d9317e8d26 |
hex | 1001db619db |
1100010101211 has 36 divisors (see below), whose sum is σ = 1848633782112. Its totient is φ = 628469229024.
The previous prime is 1100010101191. The next prime is 1100010101303. The reversal of 1100010101211 is 1121010100011.
It is a de Polignac number, because none of the positive numbers 2k-1100010101211 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1100010101193 and 1100010101202.
It is not an unprimeable number, because it can be changed into a prime (1100010101711) by changing a digit.
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 35 ways as a sum of consecutive naturals, for example, 2391945 + ... + 2814501.
It is an arithmetic number, because the mean of its divisors is an integer number (51350938392).
Almost surely, 21100010101211 is an apocalyptic number.
1100010101211 is a deficient number, since it is larger than the sum of its proper divisors (748623680901).
1100010101211 is a wasteful number, since it uses less digits than its factorization.
1100010101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428480 (or 428470 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100010101211 its reverse (1121010100011), we get a palindrome (2221020201222).
The spelling of 1100010101211 in words is "one trillion, one hundred billion, ten million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •