Base | Representation |
---|---|
bin | 1101101101011… |
… | …00001101011101 |
3 | 22000101121120002 |
4 | 12312230031131 |
5 | 213420001112 |
6 | 15224504045 |
7 | 2564325266 |
oct | 666541535 |
9 | 260347502 |
10 | 115000157 |
11 | 59a07358 |
12 | 3261b025 |
13 | 1aa9623c |
14 | 113b796d |
15 | a1691c2 |
hex | 6dac35d |
115000157 has 2 divisors, whose sum is σ = 115000158. Its totient is φ = 115000156.
The previous prime is 115000099. The next prime is 115000177. The reversal of 115000157 is 751000511.
It is an a-pointer prime, because the next prime (115000177) can be obtained adding 115000157 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89000356 + 25999801 = 9434^2 + 5099^2 .
It is a cyclic number.
It is not a de Polignac number, because 115000157 - 28 = 114999901 is a prime.
It is a super-2 number, since 2×1150001572 = 26450072220049298, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115000177) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57500078 + 57500079.
It is an arithmetic number, because the mean of its divisors is an integer number (57500079).
Almost surely, 2115000157 is an apocalyptic number.
It is an amenable number.
115000157 is a deficient number, since it is larger than the sum of its proper divisors (1).
115000157 is an equidigital number, since it uses as much as digits as its factorization.
115000157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 175, while the sum is 20.
The square root of 115000157 is about 10723.8126149239. The cubic root of 115000157 is about 486.2946344085.
Adding to 115000157 its reverse (751000511), we get a palindrome (866000668).
The spelling of 115000157 in words is "one hundred fifteen million, one hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •