Base | Representation |
---|---|
bin | 1001001111101011110… |
… | …0000011110000000001 |
3 | 120011222001112121120002 |
4 | 2103322330003300001 |
5 | 10100240142330112 |
6 | 200544233525345 |
7 | 14321633060642 |
oct | 2237274036001 |
9 | 504861477502 |
10 | 158828870657 |
11 | 613a4836376 |
12 | 26947573855 |
13 | 11c92743392 |
14 | 798a17b6c9 |
15 | 41e8c561c2 |
hex | 24faf03c01 |
158828870657 has 2 divisors, whose sum is σ = 158828870658. Its totient is φ = 158828870656.
The previous prime is 158828870639. The next prime is 158828870671. The reversal of 158828870657 is 756078828851.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 158492368321 + 336502336 = 398111^2 + 18344^2 .
It is a cyclic number.
It is not a de Polignac number, because 158828870657 - 220 = 158827822081 is a prime.
It is a super-2 number, since 2×1588288706572 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 158828870593 and 158828870602.
It is not a weakly prime, because it can be changed into another prime (158828870677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79414435328 + 79414435329.
It is an arithmetic number, because the mean of its divisors is an integer number (79414435329).
Almost surely, 2158828870657 is an apocalyptic number.
It is an amenable number.
158828870657 is a deficient number, since it is larger than the sum of its proper divisors (1).
158828870657 is an equidigital number, since it uses as much as digits as its factorization.
158828870657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60211200, while the sum is 65.
The spelling of 158828870657 in words is "one hundred fifty-eight billion, eight hundred twenty-eight million, eight hundred seventy thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •