Base | Representation |
---|---|
bin | 1010011101011010111010… |
… | …00011100111101011001111 |
3 | 10000102212212222110111220211 |
4 | 11032231131003213223033 |
5 | 11003322233420200421 |
6 | 120530321540223251 |
7 | 4562526655332634 |
oct | 516553503475317 |
9 | 100385788414824 |
10 | 23001111100111 |
11 | 736879763a771 |
12 | 26b592969ab27 |
13 | caacc307cb11 |
14 | 59738c94218b |
15 | 29d4a1e049e1 |
hex | 14eb5d0e7acf |
23001111100111 has 2 divisors, whose sum is σ = 23001111100112. Its totient is φ = 23001111100110.
The previous prime is 23001111100109. The next prime is 23001111100133. The reversal of 23001111100111 is 11100111110032.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23001111100111 - 21 = 23001111100109 is a prime.
It is a super-2 number, since 2×230011111001112 (a number of 28 digits) contains 22 as substring.
Together with 23001111100109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 23001111100091 and 23001111100100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23001111100211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11500555550055 + 11500555550056.
It is an arithmetic number, because the mean of its divisors is an integer number (11500555550056).
Almost surely, 223001111100111 is an apocalyptic number.
23001111100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
23001111100111 is an equidigital number, since it uses as much as digits as its factorization.
23001111100111 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 13.
Adding to 23001111100111 its reverse (11100111110032), we get a palindrome (34101222210143).
The spelling of 23001111100111 in words is "twenty-three trillion, one billion, one hundred eleven million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •