Base | Representation |
---|---|
bin | 10000010011001011001… |
… | …110010011011000011011 |
3 | 10222002011202200110000211 |
4 | 100103023032103120123 |
5 | 121322431330134321 |
6 | 2214322312111551 |
7 | 143632101405634 |
oct | 20231316233033 |
9 | 3862152613024 |
10 | 1120101021211 |
11 | 3a2039909817 |
12 | 1610bb6955b7 |
13 | 81818393473 |
14 | 3c2dad6888b |
15 | 1e20a5240e1 |
hex | 104cb39361b |
1120101021211 has 2 divisors, whose sum is σ = 1120101021212. Its totient is φ = 1120101021210.
The previous prime is 1120101021199. The next prime is 1120101021229. The reversal of 1120101021211 is 1121201010211.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1121201010211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1120101021211 - 215 = 1120100988443 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120101021191 and 1120101021200.
It is not a weakly prime, because it can be changed into another prime (1120101021911) 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 as a sum of consecutive naturals, namely, 560050510605 + 560050510606.
It is an arithmetic number, because the mean of its divisors is an integer number (560050510606).
Almost surely, 21120101021211 is an apocalyptic number.
1120101021211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120101021211 is an equidigital number, since it uses as much as digits as its factorization.
1120101021211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1120101021211 its reverse (1121201010211), we get a palindrome (2241302031422).
The spelling of 1120101021211 in words is "one trillion, one hundred twenty billion, one hundred one million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •