Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …001100001001110100101 |
3 | 10220011121021020120021100 |
4 | 100000210101201032211 |
5 | 121011021232400401 |
6 | 2201215505510313 |
7 | 142324001261106 |
oct | 20004421411645 |
9 | 3804537216240 |
10 | 1100120200101 |
11 | 39461619a11a |
12 | 159264042399 |
13 | 7c9829722b0 |
14 | 3b3634363ad |
15 | 1d93b2e5b86 |
hex | 100244613a5 |
1100120200101 has 48 divisors (see below), whose sum is σ = 1715181564096. Its totient is φ = 675461991168.
The previous prime is 1100120200063. The next prime is 1100120200117. The reversal of 1100120200101 is 1010020210011.
It is a happy number.
It is not a de Polignac number, because 1100120200101 - 211 = 1100120198053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100120200141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 241941910 + ... + 241946456.
It is an arithmetic number, because the mean of its divisors is an integer number (35732949252).
Almost surely, 21100120200101 is an apocalyptic number.
It is an amenable number.
1100120200101 is a deficient number, since it is larger than the sum of its proper divisors (615061363995).
1100120200101 is a wasteful number, since it uses less digits than its factorization.
1100120200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8802 (or 8799 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1100120200101 its reverse (1010020210011), we get a palindrome (2110140410112).
The spelling of 1100120200101 in words is "one trillion, one hundred billion, one hundred twenty million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •