Base | Representation |
---|---|
bin | 100100110110111010010… |
… | …0001011110111011100111 |
3 | 122221021111211110222020021 |
4 | 1021231310201132323213 |
5 | 1130444044133021422 |
6 | 14435054341420011 |
7 | 1031662204146562 |
oct | 111556441367347 |
9 | 18837454428207 |
10 | 5065721376487 |
11 | 16833a6721442 |
12 | 69992ba0a607 |
13 | 2a9906c65215 |
14 | 13727a03b4d9 |
15 | 8bb873c1dc7 |
hex | 49b7485eee7 |
5065721376487 has 2 divisors, whose sum is σ = 5065721376488. Its totient is φ = 5065721376486.
The previous prime is 5065721376451. The next prime is 5065721376503. The reversal of 5065721376487 is 7846731275605.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5065721376487 is a prime.
It is a super-2 number, since 2×50657213764872 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5065721374487) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2532860688243 + 2532860688244.
It is an arithmetic number, because the mean of its divisors is an integer number (2532860688244).
Almost surely, 25065721376487 is an apocalyptic number.
5065721376487 is a deficient number, since it is larger than the sum of its proper divisors (1).
5065721376487 is an equidigital number, since it uses as much as digits as its factorization.
5065721376487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 59270400, while the sum is 61.
The spelling of 5065721376487 in words is "five trillion, sixty-five billion, seven hundred twenty-one million, three hundred seventy-six thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •