Base | Representation |
---|---|
bin | 100101011111001001010… |
… | …1001110001000001101101 |
3 | 200020112112112102022022002 |
4 | 1022332102221301001231 |
5 | 1133403023302211112 |
6 | 14542504253102045 |
7 | 1041141330132623 |
oct | 112762251610155 |
9 | 20215475368262 |
10 | 5152126210157 |
11 | 1707005a25893 |
12 | 6b2624787925 |
13 | 2b4ac6caa534 |
14 | 13b515687513 |
15 | 8e042ce41c2 |
hex | 4af92a7106d |
5152126210157 has 2 divisors, whose sum is σ = 5152126210158. Its totient is φ = 5152126210156.
The previous prime is 5152126210139. The next prime is 5152126210159. The reversal of 5152126210157 is 7510126212515.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3247135524361 + 1904990685796 = 1801981^2 + 1380214^2 .
It is a cyclic number.
It is not a de Polignac number, because 5152126210157 - 212 = 5152126206061 is a prime.
Together with 5152126210159, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5152126210157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5152126210159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2576063105078 + 2576063105079.
It is an arithmetic number, because the mean of its divisors is an integer number (2576063105079).
Almost surely, 25152126210157 is an apocalyptic number.
It is an amenable number.
5152126210157 is a deficient number, since it is larger than the sum of its proper divisors (1).
5152126210157 is an equidigital number, since it uses as much as digits as its factorization.
5152126210157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 38.
The spelling of 5152126210157 in words is "five trillion, one hundred fifty-two billion, one hundred twenty-six million, two hundred ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •