Base | Representation |
---|---|
bin | 1001010000001011111… |
… | …1010000110000110001 |
3 | 120012022110200020120002 |
4 | 2110002333100300301 |
5 | 10101024231144423 |
6 | 201005500355345 |
7 | 14325163044314 |
oct | 2240277206061 |
9 | 505273606502 |
10 | 158963928113 |
11 | 61463aa2001 |
12 | 26984845b55 |
13 | 11cb470cb33 |
14 | 79a009697b |
15 | 4205a33228 |
hex | 2502fd0c31 |
158963928113 has 2 divisors, whose sum is σ = 158963928114. Its totient is φ = 158963928112.
The previous prime is 158963928107. The next prime is 158963928131. The reversal of 158963928113 is 311829369851.
It is a happy number.
Together with next prime (158963928131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 151427604769 + 7536323344 = 389137^2 + 86812^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-158963928113 is a prime.
It is a super-2 number, since 2×1589639281132 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (158963928133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79481964056 + 79481964057.
It is an arithmetic number, because the mean of its divisors is an integer number (79481964057).
Almost surely, 2158963928113 is an apocalyptic number.
It is an amenable number.
158963928113 is a deficient number, since it is larger than the sum of its proper divisors (1).
158963928113 is an equidigital number, since it uses as much as digits as its factorization.
158963928113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2799360, while the sum is 56.
The spelling of 158963928113 in words is "one hundred fifty-eight billion, nine hundred sixty-three million, nine hundred twenty-eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •