Base | Representation |
---|---|
bin | 100101100001001011110… |
… | …1111011100101001111101 |
3 | 200020221211210210202222121 |
4 | 1023002113233130221331 |
5 | 1133441011134143312 |
6 | 14544511051042541 |
7 | 1041355016340424 |
oct | 113022757345175 |
9 | 20227753722877 |
10 | 5156506552957 |
11 | 1708953579201 |
12 | 6b3447740451 |
13 | 2b534464a156 |
14 | 13b80d3262bb |
15 | 8e1ec648707 |
hex | 4b097bdca7d |
5156506552957 has 2 divisors, whose sum is σ = 5156506552958. Its totient is φ = 5156506552956.
The previous prime is 5156506552921. The next prime is 5156506552961. The reversal of 5156506552957 is 7592556056515.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3434391010521 + 1722115542436 = 1853211^2 + 1312294^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5156506552957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5156506552895 and 5156506552904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5156506592957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2578253276478 + 2578253276479.
It is an arithmetic number, because the mean of its divisors is an integer number (2578253276479).
Almost surely, 25156506552957 is an apocalyptic number.
It is an amenable number.
5156506552957 is a deficient number, since it is larger than the sum of its proper divisors (1).
5156506552957 is an equidigital number, since it uses as much as digits as its factorization.
5156506552957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70875000, while the sum is 61.
It can be divided in two parts, 515650 and 6552957, that added together give a palindrome (7068607).
The spelling of 5156506552957 in words is "five trillion, one hundred fifty-six billion, five hundred six million, five hundred fifty-two thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •