Base | Representation |
---|---|
bin | 10111100111001001… |
… | …001000111011011001 |
3 | 2102102212201010020101 |
4 | 113213021020323121 |
5 | 403410302103431 |
6 | 15351421455401 |
7 | 1555156661062 |
oct | 274711107331 |
9 | 72385633211 |
10 | 25352769241 |
11 | a82aa82858 |
12 | 4ab6711561 |
13 | 251064c007 |
14 | 1327175569 |
15 | 9d5b56961 |
hex | 5e7248ed9 |
25352769241 has 2 divisors, whose sum is σ = 25352769242. Its totient is φ = 25352769240.
The previous prime is 25352769203. The next prime is 25352769287. The reversal of 25352769241 is 14296725352.
It is an a-pointer prime, because the next prime (25352769287) can be obtained adding 25352769241 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20649690000 + 4703079241 = 143700^2 + 68579^2 .
It is a cyclic number.
It is not a de Polignac number, because 25352769241 - 215 = 25352736473 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25352769191 and 25352769200.
It is not a weakly prime, because it can be changed into another prime (25352769941) 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, 12676384620 + 12676384621.
It is an arithmetic number, because the mean of its divisors is an integer number (12676384621).
Almost surely, 225352769241 is an apocalyptic number.
It is an amenable number.
25352769241 is a deficient number, since it is larger than the sum of its proper divisors (1).
25352769241 is an equidigital number, since it uses as much as digits as its factorization.
25352769241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 907200, while the sum is 46.
The spelling of 25352769241 in words is "twenty-five billion, three hundred fifty-two million, seven hundred sixty-nine thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •