Base | Representation |
---|---|
bin | 10111011011101011… |
… | …110010010110101111 |
3 | 2101221110222010000212 |
4 | 113123223302112233 |
5 | 403012043301411 |
6 | 15320353213035 |
7 | 1550333635652 |
oct | 273353622657 |
9 | 71843863025 |
10 | 25160525231 |
11 | a741508006 |
12 | 4a6226117b |
13 | 24ac87c06a |
14 | 1309811899 |
15 | 9c3d3068b |
hex | 5dbaf25af |
25160525231 has 2 divisors, whose sum is σ = 25160525232. Its totient is φ = 25160525230.
The previous prime is 25160525213. The next prime is 25160525237. The reversal of 25160525231 is 13252506152.
Together with previous prime (25160525213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 25160525231 - 26 = 25160525167 is a prime.
It is a super-2 number, since 2×251605252312 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25160525237) 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, 12580262615 + 12580262616.
It is an arithmetic number, because the mean of its divisors is an integer number (12580262616).
Almost surely, 225160525231 is an apocalyptic number.
25160525231 is a deficient number, since it is larger than the sum of its proper divisors (1).
25160525231 is an equidigital number, since it uses as much as digits as its factorization.
25160525231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 25160525231 in words is "twenty-five billion, one hundred sixty million, five hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •