Base | Representation |
---|---|
bin | 10010111010001… |
… | …01100111000001 |
3 | 102001110201212102 |
4 | 21131011213001 |
5 | 311101320342 |
6 | 23423440145 |
7 | 3634151156 |
oct | 1135054701 |
9 | 361421772 |
10 | 158620097 |
11 | 8159a699 |
12 | 45156055 |
13 | 26b2965c |
14 | 170d022d |
15 | ddd3832 |
hex | 97459c1 |
158620097 has 2 divisors, whose sum is σ = 158620098. Its totient is φ = 158620096.
The previous prime is 158620061. The next prime is 158620139. The reversal of 158620097 is 790026851.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 125798656 + 32821441 = 11216^2 + 5729^2 .
It is a cyclic number.
It is not a de Polignac number, because 158620097 - 28 = 158619841 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 158620097.
It is not a weakly prime, because it can be changed into another prime (158620697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79310048 + 79310049.
It is an arithmetic number, because the mean of its divisors is an integer number (79310049).
Almost surely, 2158620097 is an apocalyptic number.
It is an amenable number.
158620097 is a deficient number, since it is larger than the sum of its proper divisors (1).
158620097 is an equidigital number, since it uses as much as digits as its factorization.
158620097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 158620097 is about 12594.4470700384. The cubic root of 158620097 is about 541.3183346350.
The spelling of 158620097 in words is "one hundred fifty-eight million, six hundred twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •