Base | Representation |
---|---|
bin | 100001011110000010110… |
… | …011101110001100110111 |
3 | 22010212201002201120101211 |
4 | 201132002303232030313 |
5 | 300140401014200043 |
6 | 4520334551102251 |
7 | 325112124165055 |
oct | 41360263561467 |
9 | 8125632646354 |
10 | 2300002100023 |
11 | 807475251941 |
12 | 31190a071987 |
13 | 138b73949aa4 |
14 | 7d46bdbb1d5 |
15 | 3ec65953a9d |
hex | 21782cee337 |
2300002100023 has 2 divisors, whose sum is σ = 2300002100024. Its totient is φ = 2300002100022.
The previous prime is 2300002099963. The next prime is 2300002100027. The reversal of 2300002100023 is 3200012000032.
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-2300002100023 is a prime.
It is a super-2 number, since 2×23000021000232 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2300002099976 and 2300002100012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2300002100027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150001050011 + 1150001050012.
It is an arithmetic number, because the mean of its divisors is an integer number (1150001050012).
Almost surely, 22300002100023 is an apocalyptic number.
2300002100023 is a deficient number, since it is larger than the sum of its proper divisors (1).
2300002100023 is an equidigital number, since it uses as much as digits as its factorization.
2300002100023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 2300002100023 its reverse (3200012000032), we get a palindrome (5500014100055).
Subtracting 2300002100023 from its reverse (3200012000032), we obtain a palindrome (900009900009).
The spelling of 2300002100023 in words is "two trillion, three hundred billion, two million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •