Base | Representation |
---|---|
bin | 11101111011011… |
… | …011111010110101 |
3 | 1021222211100022101 |
4 | 131323123322311 |
5 | 2012020320432 |
6 | 121454102101 |
7 | 15304644022 |
oct | 3573337265 |
9 | 1258740271 |
10 | 502120117 |
11 | 238485304 |
12 | 1201aa931 |
13 | 800480c5 |
14 | 4a988549 |
15 | 2e1364e7 |
hex | 1dedbeb5 |
502120117 has 2 divisors, whose sum is σ = 502120118. Its totient is φ = 502120116.
The previous prime is 502120103. The next prime is 502120127. The reversal of 502120117 is 711021205.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 495774756 + 6345361 = 22266^2 + 2519^2 .
It is a cyclic number.
It is not a de Polignac number, because 502120117 - 215 = 502087349 is a prime.
It is a super-2 number, since 2×5021201172 = 504249223792187378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 502120094 and 502120103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (502120127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 251060058 + 251060059.
It is an arithmetic number, because the mean of its divisors is an integer number (251060059).
Almost surely, 2502120117 is an apocalyptic number.
It is an amenable number.
502120117 is a deficient number, since it is larger than the sum of its proper divisors (1).
502120117 is an equidigital number, since it uses as much as digits as its factorization.
502120117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
The square root of 502120117 is about 22408.0368841182. The cubic root of 502120117 is about 794.8207694268.
The spelling of 502120117 in words is "five hundred two million, one hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •