Base | Representation |
---|---|
bin | 10111100101000010… |
… | …100000010000010101 |
3 | 2102100102022000010012 |
4 | 113211002200100111 |
5 | 403322233202344 |
6 | 15344121210005 |
7 | 1554250663325 |
oct | 274502402025 |
9 | 72312260105 |
10 | 25317475349 |
11 | a812066a51 |
12 | 4aa6930905 |
13 | 250624255a |
14 | 13225c9285 |
15 | 9d29d429e |
hex | 5e50a0415 |
25317475349 has 2 divisors, whose sum is σ = 25317475350. Its totient is φ = 25317475348.
The previous prime is 25317475321. The next prime is 25317475399. The reversal of 25317475349 is 94357471352.
It is an a-pointer prime, because the next prime (25317475399) can be obtained adding 25317475349 to its sum of digits (50).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25219663249 + 97812100 = 158807^2 + 9890^2 .
It is a cyclic number.
It is not a de Polignac number, because 25317475349 - 224 = 25300698133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25317475297 and 25317475306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25317475399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12658737674 + 12658737675.
It is an arithmetic number, because the mean of its divisors is an integer number (12658737675).
Almost surely, 225317475349 is an apocalyptic number.
It is an amenable number.
25317475349 is a deficient number, since it is larger than the sum of its proper divisors (1).
25317475349 is an equidigital number, since it uses as much as digits as its factorization.
25317475349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3175200, while the sum is 50.
The spelling of 25317475349 in words is "twenty-five billion, three hundred seventeen million, four hundred seventy-five thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •