Base | Representation |
---|---|
bin | 1101110101010… |
… | …01010100100001 |
3 | 22002100021200212 |
4 | 12322221110201 |
5 | 214201140042 |
6 | 15303023505 |
7 | 2606203664 |
oct | 672512441 |
9 | 262307625 |
10 | 116036897 |
11 | 5a555269 |
12 | 32a3ab95 |
13 | 1b06a0b2 |
14 | 115a76db |
15 | a2c1482 |
hex | 6ea9521 |
116036897 has 2 divisors, whose sum is σ = 116036898. Its totient is φ = 116036896.
The previous prime is 116036881. The next prime is 116036903. The reversal of 116036897 is 798630611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115971361 + 65536 = 10769^2 + 256^2 .
It is a cyclic number.
It is not a de Polignac number, because 116036897 - 24 = 116036881 is a prime.
It is a super-2 number, since 2×1160368972 = 26929122930777218, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (116036827) 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, 58018448 + 58018449.
It is an arithmetic number, because the mean of its divisors is an integer number (58018449).
Almost surely, 2116036897 is an apocalyptic number.
It is an amenable number.
116036897 is a deficient number, since it is larger than the sum of its proper divisors (1).
116036897 is an equidigital number, since it uses as much as digits as its factorization.
116036897 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 41.
The square root of 116036897 is about 10772.0423783051. The cubic root of 116036897 is about 487.7515994277.
The spelling of 116036897 in words is "one hundred sixteen million, thirty-six thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •