Base | Representation |
---|---|
bin | 11001010010010101011010… |
… | …101101111111011100011111 |
3 | 112120202200022111001120211212 |
4 | 121102111122231333130133 |
5 | 104034040323202413434 |
6 | 1032305402334335035 |
7 | 32265510661415525 |
oct | 3122253255773437 |
9 | 476680274046755 |
10 | 111211110201119 |
11 | 32487404493885 |
12 | 1058155b95a47b |
13 | 4a09216589566 |
14 | 1d66909c24315 |
15 | ccccc99a98ce |
hex | 65255ab7f71f |
111211110201119 has 2 divisors, whose sum is σ = 111211110201120. Its totient is φ = 111211110201118.
The previous prime is 111211110201097. The next prime is 111211110201133. The reversal of 111211110201119 is 911102011112111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111211110201119 - 212 = 111211110197023 is a prime.
It is a super-2 number, since 2×1112111102011192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111211110201094 and 111211110201103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111211110251119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55605555100559 + 55605555100560.
It is an arithmetic number, because the mean of its divisors is an integer number (55605555100560).
Almost surely, 2111211110201119 is an apocalyptic number.
111211110201119 is a deficient number, since it is larger than the sum of its proper divisors (1).
111211110201119 is an equidigital number, since it uses as much as digits as its factorization.
111211110201119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 23.
The spelling of 111211110201119 in words is "one hundred eleven trillion, two hundred eleven billion, one hundred ten million, two hundred one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •