Base | Representation |
---|---|
bin | 11001010010001011001011… |
… | …000111110010101111101011 |
3 | 112120201121220221022220221012 |
4 | 121102023023013302233223 |
5 | 104033400311421024042 |
6 | 1032300343101534135 |
7 | 32264641262613032 |
oct | 3122131307625753 |
9 | 476647827286835 |
10 | 111200111111147 |
11 | 3248277a817783 |
12 | 1057b3b027434b |
13 | 4a081828c01b6 |
14 | 1d6618510d719 |
15 | ccc884049e82 |
hex | 6522cb1f2beb |
111200111111147 has 2 divisors, whose sum is σ = 111200111111148. Its totient is φ = 111200111111146.
The previous prime is 111200111111093. The next prime is 111200111111149. The reversal of 111200111111147 is 741111111002111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111200111111147 is a prime.
It is a super-2 number, since 2×1112001111111472 (a number of 29 digits) contains 22 as substring.
Together with 111200111111149, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (111200111111149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55600055555573 + 55600055555574.
It is an arithmetic number, because the mean of its divisors is an integer number (55600055555574).
Almost surely, 2111200111111147 is an apocalyptic number.
111200111111147 is a deficient number, since it is larger than the sum of its proper divisors (1).
111200111111147 is an equidigital number, since it uses as much as digits as its factorization.
111200111111147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 23.
Adding to 111200111111147 its reverse (741111111002111), we get a palindrome (852311222113258).
The spelling of 111200111111147 in words is "one hundred eleven trillion, two hundred billion, one hundred eleven million, one hundred eleven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •