Base | Representation |
---|---|
bin | 1101110101111… |
… | …10000110110101 |
3 | 22002111121111012 |
4 | 12322332012311 |
5 | 214211401122 |
6 | 15304522005 |
7 | 2610010133 |
oct | 672760665 |
9 | 262447435 |
10 | 116122037 |
11 | 5a603229 |
12 | 32a80305 |
13 | 1b099a85 |
14 | 115ca753 |
15 | a2db7e2 |
hex | 6ebe1b5 |
116122037 has 2 divisors, whose sum is σ = 116122038. Its totient is φ = 116122036.
The previous prime is 116122031. The next prime is 116122073. The reversal of 116122037 is 730221611.
Together with next prime (116122073) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109014481 + 7107556 = 10441^2 + 2666^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116122037 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116122031) 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, 58061018 + 58061019.
It is an arithmetic number, because the mean of its divisors is an integer number (58061019).
Almost surely, 2116122037 is an apocalyptic number.
It is an amenable number.
116122037 is a deficient number, since it is larger than the sum of its proper divisors (1).
116122037 is an equidigital number, since it uses as much as digits as its factorization.
116122037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
The square root of 116122037 is about 10775.9935504806. The cubic root of 116122037 is about 487.8708632705.
Adding to 116122037 its reverse (730221611), we get a palindrome (846343648).
The spelling of 116122037 in words is "one hundred sixteen million, one hundred twenty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •