Base | Representation |
---|---|
bin | 11000001010101011… |
… | …011100101000111001 |
3 | 2110222102120000122211 |
4 | 120022223130220321 |
5 | 411120413343213 |
6 | 15530520215121 |
7 | 1606016365306 |
oct | 301253345071 |
9 | 73872500584 |
10 | 25948965433 |
11 | 10006572886 |
12 | 504230a4a1 |
13 | 25a7015421 |
14 | 138240c0ad |
15 | a1d17253d |
hex | 60aadca39 |
25948965433 has 2 divisors, whose sum is σ = 25948965434. Its totient is φ = 25948965432.
The previous prime is 25948965377. The next prime is 25948965473. The reversal of 25948965433 is 33456984952.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17137951744 + 8811013689 = 130912^2 + 93867^2 .
It is a cyclic number.
It is not a de Polignac number, because 25948965433 - 217 = 25948834361 is a prime.
It is not a weakly prime, because it can be changed into another prime (25948965473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12974482716 + 12974482717.
It is an arithmetic number, because the mean of its divisors is an integer number (12974482717).
Almost surely, 225948965433 is an apocalyptic number.
It is an amenable number.
25948965433 is a deficient number, since it is larger than the sum of its proper divisors (1).
25948965433 is an equidigital number, since it uses as much as digits as its factorization.
25948965433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27993600, while the sum is 58.
The spelling of 25948965433 in words is "twenty-five billion, nine hundred forty-eight million, nine hundred sixty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •