Base | Representation |
---|---|
bin | 100100110110101011100… |
… | …0011110001111000101011 |
3 | 122221020020101022121111211 |
4 | 1021231113003301320223 |
5 | 1130442041111104124 |
6 | 14434533322333551 |
7 | 1031644022354215 |
oct | 111552703617053 |
9 | 18836211277454 |
10 | 5065227050539 |
11 | 168317268aaa7 |
12 | 69981235a2b7 |
13 | 2a9858718966 |
14 | 1372305215b5 |
15 | 8bb58cc9e94 |
hex | 49b570f1e2b |
5065227050539 has 2 divisors, whose sum is σ = 5065227050540. Its totient is φ = 5065227050538.
The previous prime is 5065227050491. The next prime is 5065227050549. The reversal of 5065227050539 is 9350507225605.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5065227050539 - 215 = 5065227017771 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5065227050492 and 5065227050501.
It is not a weakly prime, because it can be changed into another prime (5065227050549) 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, 2532613525269 + 2532613525270.
It is an arithmetic number, because the mean of its divisors is an integer number (2532613525270).
Almost surely, 25065227050539 is an apocalyptic number.
5065227050539 is a deficient number, since it is larger than the sum of its proper divisors (1).
5065227050539 is an equidigital number, since it uses as much as digits as its factorization.
5065227050539 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835000, while the sum is 49.
The spelling of 5065227050539 in words is "five trillion, sixty-five billion, two hundred twenty-seven million, fifty thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •