Base | Representation |
---|---|
bin | 11001010000111000010010… |
… | …010011010011111111010111 |
3 | 112120102010012100220211111012 |
4 | 121100320102103103333113 |
5 | 104030421023404000043 |
6 | 1032151423440402435 |
7 | 32255340624265301 |
oct | 3120702223237727 |
9 | 476363170824435 |
10 | 111111111000023 |
11 | 32448a59553a32 |
12 | 105660b231641b |
13 | 49cc96ac99654 |
14 | 1d61b40d30971 |
15 | cca3c587ba18 |
hex | 650e124d3fd7 |
111111111000023 has 2 divisors, whose sum is σ = 111111111000024. Its totient is φ = 111111111000022.
The previous prime is 111111110999891. The next prime is 111111111000053. The reversal of 111111111000023 is 320000111111111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111111111000023 - 216 = 111111110934487 is a prime.
It is a super-2 number, since 2×1111111110000232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111111110999971 and 111111111000007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111111111000053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555555500011 + 55555555500012.
It is an arithmetic number, because the mean of its divisors is an integer number (55555555500012).
Almost surely, 2111111111000023 is an apocalyptic number.
111111111000023 is a deficient number, since it is larger than the sum of its proper divisors (1).
111111111000023 is an equidigital number, since it uses as much as digits as its factorization.
111111111000023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 111111111000023 its reverse (320000111111111), we get a palindrome (431111222111134).
The spelling of 111111111000023 in words is "one hundred eleven trillion, one hundred eleven billion, one hundred eleven million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •