Base | Representation |
---|---|
bin | 10101011011100000… |
… | …010011010101111011 |
3 | 2012101121102200111022 |
4 | 111123200103111323 |
5 | 334111031442341 |
6 | 14323132453055 |
7 | 1443132015254 |
oct | 253340232573 |
9 | 65347380438 |
10 | 23010030971 |
11 | 9838620924 |
12 | 456201a18b |
13 | 2229191b55 |
14 | 1183d7db2b |
15 | 8ea141e4b |
hex | 55b81357b |
23010030971 has 2 divisors, whose sum is σ = 23010030972. Its totient is φ = 23010030970.
The previous prime is 23010030941. The next prime is 23010031019. The reversal of 23010030971 is 17903001032.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23010030971 - 230 = 21936289147 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23010030971.
It is not a weakly prime, because it can be changed into another prime (23010030941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11505015485 + 11505015486.
It is an arithmetic number, because the mean of its divisors is an integer number (11505015486).
Almost surely, 223010030971 is an apocalyptic number.
23010030971 is a deficient number, since it is larger than the sum of its proper divisors (1).
23010030971 is an equidigital number, since it uses as much as digits as its factorization.
23010030971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 26.
The spelling of 23010030971 in words is "twenty-three billion, ten million, thirty thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •