Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …1001001010111111101011 |
3 | 1110022011022012102210210211 |
4 | 2201201301221022333223 |
5 | 2423331002120024321 |
6 | 35335152211121551 |
7 | 2223645610116211 |
oct | 241416151127753 |
9 | 43264265383724 |
10 | 11100102111211 |
11 | 359a588298743 |
12 | 12b33358a32b7 |
13 | 626973136219 |
14 | 2a5367db6cb1 |
15 | 143b148640e1 |
hex | a1871a4afeb |
11100102111211 has 2 divisors, whose sum is σ = 11100102111212. Its totient is φ = 11100102111210.
The previous prime is 11100102111167. The next prime is 11100102111227. The reversal of 11100102111211 is 11211120100111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11100102111211 - 213 = 11100102103019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100102111191 and 11100102111200.
It is not a weakly prime, because it can be changed into another prime (11100102111251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550051055605 + 5550051055606.
It is an arithmetic number, because the mean of its divisors is an integer number (5550051055606).
Almost surely, 211100102111211 is an apocalyptic number.
11100102111211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100102111211 is an equidigital number, since it uses as much as digits as its factorization.
11100102111211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11100102111211 its reverse (11211120100111), we get a palindrome (22311222211322).
The spelling of 11100102111211 in words is "eleven trillion, one hundred billion, one hundred two million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •