Base | Representation |
---|---|
bin | 10111101011111011… |
… | …001111011100101001 |
3 | 2102122110200212121202 |
4 | 113223323033130221 |
5 | 404041322341014 |
6 | 15403405413545 |
7 | 1560153015026 |
oct | 275373173451 |
9 | 72573625552 |
10 | 25433012009 |
11 | a8712aa399 |
12 | 4b1956a2b5 |
13 | 2524165a42 |
14 | 1333aa254d |
15 | 9dcc073de |
hex | 5ebecf729 |
25433012009 has 2 divisors, whose sum is σ = 25433012010. Its totient is φ = 25433012008.
The previous prime is 25433011979. The next prime is 25433012029. The reversal of 25433012009 is 90021033452.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19275157225 + 6157854784 = 138835^2 + 78472^2 .
It is a cyclic number.
It is not a de Polignac number, because 25433012009 - 232 = 21138044713 is a prime.
It is not a weakly prime, because it can be changed into another prime (25433012029) 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, 12716506004 + 12716506005.
It is an arithmetic number, because the mean of its divisors is an integer number (12716506005).
Almost surely, 225433012009 is an apocalyptic number.
It is an amenable number.
25433012009 is a deficient number, since it is larger than the sum of its proper divisors (1).
25433012009 is an equidigital number, since it uses as much as digits as its factorization.
25433012009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 29.
The spelling of 25433012009 in words is "twenty-five billion, four hundred thirty-three million, twelve thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •