Base | Representation |
---|---|
bin | 1001010100001001… |
… | …11101010100101111 |
3 | 110220112002120000121 |
4 | 10222010331110233 |
5 | 40220213111002 |
6 | 2144122505411 |
7 | 234633014623 |
oct | 45204752457 |
9 | 13815076017 |
10 | 5000910127 |
11 | 2136979884 |
12 | b76965267 |
13 | 6190b9c25 |
14 | 35625b183 |
15 | 1e4086237 |
hex | 12a13d52f |
5000910127 has 2 divisors, whose sum is σ = 5000910128. Its totient is φ = 5000910126.
The previous prime is 5000910059. The next prime is 5000910139. The reversal of 5000910127 is 7210190005.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5000910127 - 211 = 5000908079 is a prime.
It is a super-2 number, since 2×50009101272 = 50018204196662312258, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5000910227) 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, 2500455063 + 2500455064.
It is an arithmetic number, because the mean of its divisors is an integer number (2500455064).
Almost surely, 25000910127 is an apocalyptic number.
5000910127 is a deficient number, since it is larger than the sum of its proper divisors (1).
5000910127 is an equidigital number, since it uses as much as digits as its factorization.
5000910127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 25.
The square root of 5000910127 is about 70717.1133955565. The cubic root of 5000910127 is about 1710.0796934007.
The spelling of 5000910127 in words is "five billion, nine hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •