Base | Representation |
---|---|
bin | 111110100000100… |
… | …100011111111001 |
3 | 2201002100202221002 |
4 | 332200210133321 |
5 | 4121433203442 |
6 | 252021454345 |
7 | 34663006511 |
oct | 7640443771 |
9 | 2632322832 |
10 | 1048725497 |
11 | 498a83a96 |
12 | 2532713b5 |
13 | 13936a441 |
14 | 9d3d2841 |
15 | 62108732 |
hex | 3e8247f9 |
1048725497 has 2 divisors, whose sum is σ = 1048725498. Its totient is φ = 1048725496.
The previous prime is 1048725479. The next prime is 1048725569. The reversal of 1048725497 is 7945278401.
Together with previous prime (1048725479) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 997043776 + 51681721 = 31576^2 + 7189^2 .
It is a cyclic number.
It is not a de Polignac number, because 1048725497 - 228 = 780290041 is a prime.
It is not a weakly prime, because it can be changed into another prime (1048725407) 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, 524362748 + 524362749.
It is an arithmetic number, because the mean of its divisors is an integer number (524362749).
Almost surely, 21048725497 is an apocalyptic number.
It is an amenable number.
1048725497 is a deficient number, since it is larger than the sum of its proper divisors (1).
1048725497 is an equidigital number, since it uses as much as digits as its factorization.
1048725497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 564480, while the sum is 47.
The square root of 1048725497 is about 32384.0315124600. The cubic root of 1048725497 is about 1015.9849521533.
The spelling of 1048725497 in words is "one billion, forty-eight million, seven hundred twenty-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •