Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …010000010101011110011 |
3 | 10221010002210212102120200 |
4 | 100021301022002223303 |
5 | 121141240001121321 |
6 | 2205532120410243 |
7 | 143123556332265 |
oct | 20116112025363 |
9 | 3833083772520 |
10 | 1110000020211 |
11 | 39882608a205 |
12 | 15b160916983 |
13 | 808987a19b4 |
14 | 3ba1d633b35 |
15 | 1dd18864d26 |
hex | 10271282af3 |
1110000020211 has 24 divisors (see below), whose sum is σ = 1620297407040. Its totient is φ = 732209901696.
The previous prime is 1110000020201. The next prime is 1110000020231. The reversal of 1110000020211 is 1120200000111.
It is a happy number.
It is not a de Polignac number, because 1110000020211 - 29 = 1110000019699 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 = 1110000020193 and 1110000020202.
It is not an unprimeable number, because it can be changed into a prime (1110000020201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1305730 + ... + 1981143.
It is an arithmetic number, because the mean of its divisors is an integer number (67512391960).
Almost surely, 21110000020211 is an apocalyptic number.
1110000020211 is a deficient number, since it is larger than the sum of its proper divisors (510297386829).
1110000020211 is a wasteful number, since it uses less digits than its factorization.
1110000020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3287275 (or 3287272 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1110000020211 its reverse (1120200000111), we get a palindrome (2230200020322).
The spelling of 1110000020211 in words is "one trillion, one hundred ten billion, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •