Base | Representation |
---|---|
bin | 10101100111011111… |
… | …101111010100100111 |
3 | 2012220121222122021022 |
4 | 111213133233110213 |
5 | 340014032210043 |
6 | 14355120441355 |
7 | 1451124013151 |
oct | 254737572447 |
9 | 65817878238 |
10 | 23211210023 |
11 | 9931139701 |
12 | 45b947925b |
13 | 225ba6ca01 |
14 | 11a298bad1 |
15 | 90cb30868 |
hex | 5677ef527 |
23211210023 has 2 divisors, whose sum is σ = 23211210024. Its totient is φ = 23211210022.
The previous prime is 23211209999. The next prime is 23211210047. The reversal of 23211210023 is 32001211232.
It is a balanced prime because it is at equal distance from previous prime (23211209999) and next prime (23211210047).
It is a cyclic number.
It is not a de Polignac number, because 23211210023 - 28 = 23211209767 is a prime.
It is a super-3 number, since 3×232112100233 (a number of 32 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23211209983 and 23211210010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23211210053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11605605011 + 11605605012.
It is an arithmetic number, because the mean of its divisors is an integer number (11605605012).
Almost surely, 223211210023 is an apocalyptic number.
23211210023 is a deficient number, since it is larger than the sum of its proper divisors (1).
23211210023 is an equidigital number, since it uses as much as digits as its factorization.
23211210023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 23211210023 its reverse (32001211232), we get a palindrome (55212421255).
The spelling of 23211210023 in words is "twenty-three billion, two hundred eleven million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •