Base | Representation |
---|---|
bin | 1001010101001100… |
… | …10011011010011101 |
3 | 110221010112122201212 |
4 | 10222212103122131 |
5 | 40224432320412 |
6 | 2145034114205 |
7 | 235100222354 |
oct | 45246233235 |
9 | 13833478655 |
10 | 5009651357 |
11 | 21408aa237 |
12 | b7987b965 |
13 | 61ab5a859 |
14 | 35749499b |
15 | 1e4c11222 |
hex | 12a99369d |
5009651357 has 2 divisors, whose sum is σ = 5009651358. Its totient is φ = 5009651356.
The previous prime is 5009651287. The next prime is 5009651363. The reversal of 5009651357 is 7531569005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3455793796 + 1553857561 = 58786^2 + 39419^2 .
It is a cyclic number.
It is not a de Polignac number, because 5009651357 - 216 = 5009585821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5009656357) 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, 2504825678 + 2504825679.
It is an arithmetic number, because the mean of its divisors is an integer number (2504825679).
Almost surely, 25009651357 is an apocalyptic number.
It is an amenable number.
5009651357 is a deficient number, since it is larger than the sum of its proper divisors (1).
5009651357 is an equidigital number, since it uses as much as digits as its factorization.
5009651357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141750, while the sum is 41.
The square root of 5009651357 is about 70778.8906171890. The cubic root of 5009651357 is about 1711.0754787363.
The spelling of 5009651357 in words is "five billion, nine million, six hundred fifty-one thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •