Base | Representation |
---|---|
bin | 1001010100100101… |
… | …01011000001000101 |
3 | 110220202212012110212 |
4 | 10222102223001011 |
5 | 40222123131112 |
6 | 2144331525205 |
7 | 235005410021 |
oct | 45222530105 |
9 | 13822765425 |
10 | 5004505157 |
11 | 2138a04883 |
12 | b77bb9805 |
13 | 619a78372 |
14 | 356915381 |
15 | 1e4546522 |
hex | 12a4ab045 |
5004505157 has 2 divisors, whose sum is σ = 5004505158. Its totient is φ = 5004505156.
The previous prime is 5004505123. The next prime is 5004505159. The reversal of 5004505157 is 7515054005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3949619716 + 1054885441 = 62846^2 + 32479^2 .
It is a cyclic number.
It is not a de Polignac number, because 5004505157 - 210 = 5004504133 is a prime.
Together with 5004505159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5004505159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2502252578 + 2502252579.
It is an arithmetic number, because the mean of its divisors is an integer number (2502252579).
Almost surely, 25004505157 is an apocalyptic number.
It is an amenable number.
5004505157 is a deficient number, since it is larger than the sum of its proper divisors (1).
5004505157 is an equidigital number, since it uses as much as digits as its factorization.
5004505157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17500, while the sum is 32.
The square root of 5004505157 is about 70742.5272166608. The cubic root of 5004505157 is about 1710.4893731768.
The spelling of 5004505157 in words is "five billion, four million, five hundred five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •