Base | Representation |
---|---|
bin | 10000000000011110011… |
… | …010111101100100110011 |
3 | 10220011100102111002210211 |
4 | 100000132122331210303 |
5 | 121010321113342321 |
6 | 2201202041204551 |
7 | 142321366554043 |
oct | 20003632754463 |
9 | 3804312432724 |
10 | 1100022012211 |
11 | 394575826101 |
12 | 159237190757 |
13 | 7c968514555 |
14 | 3b354397723 |
15 | 1d93289d0e1 |
hex | 1001e6bd933 |
1100022012211 has 2 divisors, whose sum is σ = 1100022012212. Its totient is φ = 1100022012210.
The previous prime is 1100022012181. The next prime is 1100022012233. The reversal of 1100022012211 is 1122102200011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100022012211 - 215 = 1100021979443 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100022012191 and 1100022012200.
It is not a weakly prime, because it can be changed into another prime (1100022012311) 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, 550011006105 + 550011006106.
It is an arithmetic number, because the mean of its divisors is an integer number (550011006106).
Almost surely, 21100022012211 is an apocalyptic number.
1100022012211 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100022012211 is an equidigital number, since it uses as much as digits as its factorization.
1100022012211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1100022012211 its reverse (1122102200011), we get a palindrome (2222124212222).
The spelling of 1100022012211 in words is "one trillion, one hundred billion, twenty-two million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •