Base | Representation |
---|---|
bin | 100101011110111000011… |
… | …0100100010011111100101 |
3 | 200020111001222101011201011 |
4 | 1022331300310202133211 |
5 | 1133400343000440434 |
6 | 14542332055302221 |
7 | 1041121265452441 |
oct | 112756064423745 |
9 | 20214058334634 |
10 | 5151558608869 |
11 | 1706844596612 |
12 | 6b24a667a971 |
13 | 2b4a3651669a |
14 | 13b4a0135821 |
15 | 8e00d075e64 |
hex | 4af70d227e5 |
5151558608869 has 2 divisors, whose sum is σ = 5151558608870. Its totient is φ = 5151558608868.
The previous prime is 5151558608857. The next prime is 5151558608923. The reversal of 5151558608869 is 9688068551515.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5082251728225 + 69306880644 = 2254385^2 + 263262^2 .
It is a cyclic number.
It is not a de Polignac number, because 5151558608869 - 217 = 5151558477797 is a prime.
It is a super-2 number, since 2×51515586088692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5151558608069) 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, 2575779304434 + 2575779304435.
It is an arithmetic number, because the mean of its divisors is an integer number (2575779304435).
Almost surely, 25151558608869 is an apocalyptic number.
It is an amenable number.
5151558608869 is a deficient number, since it is larger than the sum of its proper divisors (1).
5151558608869 is an equidigital number, since it uses as much as digits as its factorization.
5151558608869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680000, while the sum is 67.
The spelling of 5151558608869 in words is "five trillion, one hundred fifty-one billion, five hundred fifty-eight million, six hundred eight thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •