Base | Representation |
---|---|
bin | 1010011110001000100110… |
… | …10100001011111001111001 |
3 | 10000112020012200221101000222 |
4 | 11033010103110023321321 |
5 | 11004223004243420401 |
6 | 120545500143505425 |
7 | 4564355626301546 |
oct | 517042324137171 |
9 | 100466180841028 |
10 | 23025643732601 |
11 | 7378136678654 |
12 | 26ba6355b8275 |
13 | cb04028184c3 |
14 | 598638bc9bcd |
15 | 29de3aa57c1b |
hex | 14f11350be79 |
23025643732601 has 2 divisors, whose sum is σ = 23025643732602. Its totient is φ = 23025643732600.
The previous prime is 23025643732579. The next prime is 23025643732603. The reversal of 23025643732601 is 10623734652032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15422499268201 + 7603144464400 = 3927149^2 + 2757380^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23025643732601 is a prime.
Together with 23025643732603, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (23025643732603) 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, 11512821866300 + 11512821866301.
It is an arithmetic number, because the mean of its divisors is an integer number (11512821866301).
Almost surely, 223025643732601 is an apocalyptic number.
It is an amenable number.
23025643732601 is a deficient number, since it is larger than the sum of its proper divisors (1).
23025643732601 is an equidigital number, since it uses as much as digits as its factorization.
23025643732601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 44.
The spelling of 23025643732601 in words is "twenty-three trillion, twenty-five billion, six hundred forty-three million, seven hundred thirty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •