Base | Representation |
---|---|
bin | 101011111000… |
… | …1111010101101 |
3 | 1121022002010212 |
4 | 1113301322231 |
5 | 21342322424 |
6 | 2141112205 |
7 | 366406301 |
oct | 127617255 |
9 | 47262125 |
10 | 23010989 |
11 | 11a97551 |
12 | 7858665 |
13 | 49c8a91 |
14 | 30add01 |
15 | 204810e |
hex | 15f1ead |
23010989 has 2 divisors, whose sum is σ = 23010990. Its totient is φ = 23010988.
The previous prime is 23010973. The next prime is 23010997. The reversal of 23010989 is 98901032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12545764 + 10465225 = 3542^2 + 3235^2 .
It is a cyclic number.
It is not a de Polignac number, because 23010989 - 24 = 23010973 is a prime.
It is a super-2 number, since 2×230109892 = 1059011229516242, which contains 22 as substring.
It is a Chen prime.
It is an alternating number because its digits alternate between even and odd.
23010989 is a modest number, since divided by 10989 gives 23 as remainder.
It is equal to p1448906 and since 23010989 and 1448906 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23010089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11505494 + 11505495.
It is an arithmetic number, because the mean of its divisors is an integer number (11505495).
Almost surely, 223010989 is an apocalyptic number.
It is an amenable number.
23010989 is a deficient number, since it is larger than the sum of its proper divisors (1).
23010989 is an equidigital number, since it uses as much as digits as its factorization.
23010989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 32.
The square root of 23010989 is about 4796.9770689467. The cubic root of 23010989 is about 284.4319824467.
The spelling of 23010989 in words is "twenty-three million, ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •