Base | Representation |
---|---|
bin | 10010110111000… |
… | …10111110110101 |
3 | 102000201012201012 |
4 | 21123202332311 |
5 | 311000403432 |
6 | 23411042005 |
7 | 3630546323 |
oct | 1133427665 |
9 | 360635635 |
10 | 158216117 |
11 | 81344124 |
12 | 44ba0305 |
13 | 26a17807 |
14 | 17026d13 |
15 | dd53cb2 |
hex | 96e2fb5 |
158216117 has 2 divisors, whose sum is σ = 158216118. Its totient is φ = 158216116.
The previous prime is 158216099. The next prime is 158216129. The reversal of 158216117 is 711612851.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89889361 + 68326756 = 9481^2 + 8266^2 .
It is a cyclic number.
It is not a de Polignac number, because 158216117 - 210 = 158215093 is a prime.
It is a Chen prime.
It is equal to p8880062 and since 158216117 and 8880062 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (158216017) 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, 79108058 + 79108059.
It is an arithmetic number, because the mean of its divisors is an integer number (79108059).
Almost surely, 2158216117 is an apocalyptic number.
It is an amenable number.
158216117 is a deficient number, since it is larger than the sum of its proper divisors (1).
158216117 is an equidigital number, since it uses as much as digits as its factorization.
158216117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3360, while the sum is 32.
The square root of 158216117 is about 12578.3988249697. The cubic root of 158216117 is about 540.8583935614.
Adding to 158216117 its reverse (711612851), we get a palindrome (869828968).
The spelling of 158216117 in words is "one hundred fifty-eight million, two hundred sixteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •