Base | Representation |
---|---|
bin | 100100011111100101010… |
… | …0111110000011101001101 |
3 | 122202111012121200002022011 |
4 | 1020333022213300131031 |
5 | 1124134000310113112 |
6 | 14400051421221221 |
7 | 1025236615505341 |
oct | 110771247603515 |
9 | 18674177602264 |
10 | 5015626254157 |
11 | 166412a2995a2 |
12 | 69008b101811 |
13 | 2a4c8259bbbc |
14 | 134a86c29621 |
15 | 8a7044dcaa7 |
hex | 48fca9f074d |
5015626254157 has 2 divisors, whose sum is σ = 5015626254158. Its totient is φ = 5015626254156.
The previous prime is 5015626254131. The next prime is 5015626254239. The reversal of 5015626254157 is 7514526265105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4863343679401 + 152282574756 = 2205299^2 + 390234^2 .
It is a cyclic number.
It is not a de Polignac number, because 5015626254157 - 27 = 5015626254029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5015626254157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5015626252157) 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, 2507813127078 + 2507813127079.
It is an arithmetic number, because the mean of its divisors is an integer number (2507813127079).
Almost surely, 25015626254157 is an apocalyptic number.
It is an amenable number.
5015626254157 is a deficient number, since it is larger than the sum of its proper divisors (1).
5015626254157 is an equidigital number, since it uses as much as digits as its factorization.
5015626254157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520000, while the sum is 49.
The spelling of 5015626254157 in words is "five trillion, fifteen billion, six hundred twenty-six million, two hundred fifty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •