Base | Representation |
---|---|
bin | 1001100010010111… |
… | …10010001110111001 |
3 | 111012211110001221212 |
4 | 10301023302032321 |
5 | 40441223441332 |
6 | 2204022212505 |
7 | 240611321333 |
oct | 46113621671 |
9 | 14184401855 |
10 | 5120140217 |
11 | 2198205145 |
12 | baa884135 |
13 | 637a0458a |
14 | 368016453 |
15 | 1ee7888b2 |
hex | 1312f23b9 |
5120140217 has 2 divisors, whose sum is σ = 5120140218. Its totient is φ = 5120140216.
The previous prime is 5120140187. The next prime is 5120140231. The reversal of 5120140217 is 7120410215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4363395136 + 756745081 = 66056^2 + 27509^2 .
It is a cyclic number.
It is not a de Polignac number, because 5120140217 - 226 = 5053031353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5120140192 and 5120140201.
It is not a weakly prime, because it can be changed into another prime (5120140237) 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, 2560070108 + 2560070109.
It is an arithmetic number, because the mean of its divisors is an integer number (2560070109).
Almost surely, 25120140217 is an apocalyptic number.
It is an amenable number.
5120140217 is a deficient number, since it is larger than the sum of its proper divisors (1).
5120140217 is an equidigital number, since it uses as much as digits as its factorization.
5120140217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 23.
The square root of 5120140217 is about 71555.1550693589. The cubic root of 5120140217 is about 1723.5634856511.
The spelling of 5120140217 in words is "five billion, one hundred twenty million, one hundred forty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •