Base | Representation |
---|---|
bin | 1010101110111001… |
… | …10000110011111001 |
3 | 112212120110021120212 |
4 | 11113130300303321 |
5 | 43300101000144 |
6 | 2351434200505 |
7 | 262535153252 |
oct | 52734606371 |
9 | 15776407525 |
10 | 5762125049 |
11 | 249762991a |
12 | 1149883135 |
13 | 70aa10265 |
14 | 3c93abb29 |
15 | 23aceb49e |
hex | 157730cf9 |
5762125049 has 2 divisors, whose sum is σ = 5762125050. Its totient is φ = 5762125048.
The previous prime is 5762125021. The next prime is 5762125067. The reversal of 5762125049 is 9405212675.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5720199424 + 41925625 = 75632^2 + 6475^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5762125049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5762124997 and 5762125015.
It is not a weakly prime, because it can be changed into another prime (5762125069) 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, 2881062524 + 2881062525.
It is an arithmetic number, because the mean of its divisors is an integer number (2881062525).
Almost surely, 25762125049 is an apocalyptic number.
It is an amenable number.
5762125049 is a deficient number, since it is larger than the sum of its proper divisors (1).
5762125049 is an equidigital number, since it uses as much as digits as its factorization.
5762125049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 41.
The square root of 5762125049 is about 75908.6625425583. The cubic root of 5762125049 is about 1792.7823160714.
The spelling of 5762125049 in words is "five billion, seven hundred sixty-two million, one hundred twenty-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •