Base | Representation |
---|---|
bin | 1101111011110… |
… | …10011000110101 |
3 | 22010221210101011 |
4 | 12331322120311 |
5 | 214411040422 |
6 | 15333232221 |
7 | 2616401416 |
oct | 675723065 |
9 | 263853334 |
10 | 116893237 |
11 | 5aa8a68a |
12 | 33192671 |
13 | 1b2a9ac6 |
14 | 1174b80d |
15 | a3e0077 |
hex | 6f7a635 |
116893237 has 2 divisors, whose sum is σ = 116893238. Its totient is φ = 116893236.
The previous prime is 116893211. The next prime is 116893261. The reversal of 116893237 is 732398611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115799121 + 1094116 = 10761^2 + 1046^2 .
It is a cyclic number.
It is not a de Polignac number, because 116893237 - 219 = 116368949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116893237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116893297) 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, 58446618 + 58446619.
It is an arithmetic number, because the mean of its divisors is an integer number (58446619).
Almost surely, 2116893237 is an apocalyptic number.
It is an amenable number.
116893237 is a deficient number, since it is larger than the sum of its proper divisors (1).
116893237 is an equidigital number, since it uses as much as digits as its factorization.
116893237 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54432, while the sum is 40.
The square root of 116893237 is about 10811.7175786274. The cubic root of 116893237 is about 488.9485115779.
The spelling of 116893237 in words is "one hundred sixteen million, eight hundred ninety-three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •