Base | Representation |
---|---|
bin | 11001010010010101011010… |
… | …110101010001101111001011 |
3 | 112120202200022121122121210002 |
4 | 121102111122311101233023 |
5 | 104034040324200023201 |
6 | 1032305402443313215 |
7 | 32265511013562041 |
oct | 3122253265215713 |
9 | 476680277577702 |
10 | 111211112111051 |
11 | 32487405578837 |
12 | 1058156051b80b |
13 | 4a09216aa79b4 |
14 | 1d6690a1a0391 |
15 | ccccc9c3576b |
hex | 65255ad51bcb |
111211112111051 has 2 divisors, whose sum is σ = 111211112111052. Its totient is φ = 111211112111050.
The previous prime is 111211112110991. The next prime is 111211112111101. The reversal of 111211112111051 is 150111211112111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111211112111051 - 210 = 111211112110027 is a prime.
It is a super-2 number, since 2×1112111121110512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111211112111251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55605556055525 + 55605556055526.
It is an arithmetic number, because the mean of its divisors is an integer number (55605556055526).
Almost surely, 2111211112111051 is an apocalyptic number.
111211112111051 is a deficient number, since it is larger than the sum of its proper divisors (1).
111211112111051 is an equidigital number, since it uses as much as digits as its factorization.
111211112111051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 20.
Adding to 111211112111051 its reverse (150111211112111), we get a palindrome (261322323223162).
The spelling of 111211112111051 in words is "one hundred eleven trillion, two hundred eleven billion, one hundred twelve million, one hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •