Base | Representation |
---|---|
bin | 100101001101011101010… |
… | …1001011011000110101011 |
3 | 200002220111101101002001212 |
4 | 1022122322221123012223 |
5 | 1132242230440101324 |
6 | 14513223222303335 |
7 | 1035325135013612 |
oct | 112327251330653 |
9 | 20086441332055 |
10 | 5114142503339 |
11 | 16a1994132751 |
12 | 6a71a3b87b4b |
13 | 2b135288847c |
14 | 139750bb6879 |
15 | 8d06d33c70e |
hex | 4a6baa5b1ab |
5114142503339 has 2 divisors, whose sum is σ = 5114142503340. Its totient is φ = 5114142503338.
The previous prime is 5114142503293. The next prime is 5114142503341. The reversal of 5114142503339 is 9333052414115.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5114142503339 - 28 = 5114142503083 is a prime.
It is a super-2 number, since 2×51141425033392 (a number of 26 digits) contains 22 as substring.
Together with 5114142503341, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5114142503296 and 5114142503305.
It is not a weakly prime, because it can be changed into another prime (5114142803339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2557071251669 + 2557071251670.
It is an arithmetic number, because the mean of its divisors is an integer number (2557071251670).
Almost surely, 25114142503339 is an apocalyptic number.
5114142503339 is a deficient number, since it is larger than the sum of its proper divisors (1).
5114142503339 is an equidigital number, since it uses as much as digits as its factorization.
5114142503339 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 5114142503339 in words is "five trillion, one hundred fourteen billion, one hundred forty-two million, five hundred three thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •