Base | Representation |
---|---|
bin | 1001100010000001… |
… | …10101100101100001 |
3 | 111012122001021021012 |
4 | 10301000311211201 |
5 | 40440010122434 |
6 | 2203440510305 |
7 | 240545036411 |
oct | 46100654541 |
9 | 14178037235 |
10 | 5117270369 |
11 | 2196624a72 |
12 | ba991b395 |
13 | 63723b243 |
14 | 3678aa641 |
15 | 1ee3bd3ce |
hex | 131035961 |
5117270369 has 2 divisors, whose sum is σ = 5117270370. Its totient is φ = 5117270368.
The previous prime is 5117270359. The next prime is 5117270377. The reversal of 5117270369 is 9630727115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4534675600 + 582594769 = 67340^2 + 24137^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5117270369 is a prime.
It is a super-2 number, since 2×51172703692 = 52372912058890792322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5117270359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2558635184 + 2558635185.
It is an arithmetic number, because the mean of its divisors is an integer number (2558635185).
Almost surely, 25117270369 is an apocalyptic number.
It is an amenable number.
5117270369 is a deficient number, since it is larger than the sum of its proper divisors (1).
5117270369 is an equidigital number, since it uses as much as digits as its factorization.
5117270369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79380, while the sum is 41.
The square root of 5117270369 is about 71535.0988606292. The cubic root of 5117270369 is about 1723.2414053011.
The spelling of 5117270369 in words is "five billion, one hundred seventeen million, two hundred seventy thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •