Base | Representation |
---|---|
bin | 1011011000100000001000… |
… | …01101111001011110011001 |
3 | 10021121221202012021022122212 |
4 | 11230100010031321132121 |
5 | 11240102233334400431 |
6 | 125123051432124505 |
7 | 5162303662512605 |
oct | 554200415713631 |
9 | 107557665238585 |
10 | 25031140153241 |
11 | 7a80713068632 |
12 | 2983252236735 |
13 | 10c7570a0c281 |
14 | 627729640505 |
15 | 2d61b634972b |
hex | 16c404379799 |
25031140153241 has 2 divisors, whose sum is σ = 25031140153242. Its totient is φ = 25031140153240.
The previous prime is 25031140153183. The next prime is 25031140153247. The reversal of 25031140153241 is 14235104113052.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22760332266841 + 2270807886400 = 4770779^2 + 1506920^2 .
It is a cyclic number.
It is not a de Polignac number, because 25031140153241 - 210 = 25031140152217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25031140153198 and 25031140153207.
It is not a weakly prime, because it can be changed into another prime (25031140153247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12515570076620 + 12515570076621.
It is an arithmetic number, because the mean of its divisors is an integer number (12515570076621).
Almost surely, 225031140153241 is an apocalyptic number.
It is an amenable number.
25031140153241 is a deficient number, since it is larger than the sum of its proper divisors (1).
25031140153241 is an equidigital number, since it uses as much as digits as its factorization.
25031140153241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 25031140153241 its reverse (14235104113052), we get a palindrome (39266244266293).
The spelling of 25031140153241 in words is "twenty-five trillion, thirty-one billion, one hundred forty million, one hundred fifty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •