Base | Representation |
---|---|
bin | 110101011010011… |
… | …010000111000001 |
3 | 2022110012100212112 |
4 | 311122122013001 |
5 | 3313401141022 |
6 | 224530505105 |
7 | 31130565401 |
oct | 6532320701 |
9 | 2273170775 |
10 | 896115137 |
11 | 41a919625 |
12 | 210135195 |
13 | 113866358 |
14 | 87028801 |
15 | 53a108e2 |
hex | 3569a1c1 |
896115137 has 2 divisors, whose sum is σ = 896115138. Its totient is φ = 896115136.
The previous prime is 896115133. The next prime is 896115139. The reversal of 896115137 is 731511698.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 857376961 + 38738176 = 29281^2 + 6224^2 .
It is a cyclic number.
It is not a de Polignac number, because 896115137 - 22 = 896115133 is a prime.
Together with 896115139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 896115094 and 896115103.
It is not a weakly prime, because it can be changed into another prime (896115131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 448057568 + 448057569.
It is an arithmetic number, because the mean of its divisors is an integer number (448057569).
Almost surely, 2896115137 is an apocalyptic number.
It is an amenable number.
896115137 is a deficient number, since it is larger than the sum of its proper divisors (1).
896115137 is an equidigital number, since it uses as much as digits as its factorization.
896115137 is an evil number, because the sum of its binary digits is even.
The product of its digits is 45360, while the sum is 41.
The square root of 896115137 is about 29935.1822610119. The cubic root of 896115137 is about 964.0981980309.
The spelling of 896115137 in words is "eight hundred ninety-six million, one hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •