Base | Representation |
---|---|
bin | 1001010101001100… |
… | …10011110110001101 |
3 | 110221010112202011122 |
4 | 10222212103312031 |
5 | 40224432400013 |
6 | 2145034130325 |
7 | 235100230502 |
oct | 45246236615 |
9 | 13833482148 |
10 | 5009653133 |
11 | 2140900601 |
12 | b798809a5 |
13 | 61ab5b5c4 |
14 | 3574954a9 |
15 | 1e4c11a08 |
hex | 12a993d8d |
5009653133 has 2 divisors, whose sum is σ = 5009653134. Its totient is φ = 5009653132.
The previous prime is 5009653013. The next prime is 5009653139. The reversal of 5009653133 is 3313569005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4316752804 + 692900329 = 65702^2 + 26323^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5009653133 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 = 5009653093 and 5009653102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5009653139) 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, 2504826566 + 2504826567.
It is an arithmetic number, because the mean of its divisors is an integer number (2504826567).
Almost surely, 25009653133 is an apocalyptic number.
It is an amenable number.
5009653133 is a deficient number, since it is larger than the sum of its proper divisors (1).
5009653133 is an equidigital number, since it uses as much as digits as its factorization.
5009653133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36450, while the sum is 35.
The square root of 5009653133 is about 70778.9031633014. The cubic root of 5009653133 is about 1711.0756809373.
The spelling of 5009653133 in words is "five billion, nine million, six hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •