Base | Representation |
---|---|
bin | 100101100001010001011… |
… | …1110110011101010101101 |
3 | 200020222022221122102100012 |
4 | 1023002202332303222231 |
5 | 1133441402423104444 |
6 | 14544541504543005 |
7 | 1041362466244163 |
oct | 113024276635255 |
9 | 20228287572305 |
10 | 5156695128749 |
11 | 1708a3aa68a6a |
12 | 6b349a921a65 |
13 | 2b5374734568 |
14 | 13b82a3b3233 |
15 | 8e20de97b9e |
hex | 4b0a2fb3aad |
5156695128749 has 2 divisors, whose sum is σ = 5156695128750. Its totient is φ = 5156695128748.
The previous prime is 5156695128731. The next prime is 5156695128769. The reversal of 5156695128749 is 9478215966515.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3386637839524 + 1770057289225 = 1840282^2 + 1330435^2 .
It is a cyclic number.
It is not a de Polignac number, because 5156695128749 - 232 = 5152400161453 is a prime.
It is a super-3 number, since 3×51566951287493 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5156695128769) 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, 2578347564374 + 2578347564375.
It is an arithmetic number, because the mean of its divisors is an integer number (2578347564375).
Almost surely, 25156695128749 is an apocalyptic number.
It is an amenable number.
5156695128749 is a deficient number, since it is larger than the sum of its proper divisors (1).
5156695128749 is an equidigital number, since it uses as much as digits as its factorization.
5156695128749 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 163296000, while the sum is 68.
The spelling of 5156695128749 in words is "five trillion, one hundred fifty-six billion, six hundred ninety-five million, one hundred twenty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •