Base | Representation |
---|---|
bin | 1101110101010… |
… | …11011101110001 |
3 | 22002100201202012 |
4 | 12322223131301 |
5 | 214201430211 |
6 | 15303132305 |
7 | 2606241413 |
oct | 672533561 |
9 | 262321665 |
10 | 116045681 |
11 | 5a560924 |
12 | 32a44095 |
13 | 1b0710ab |
14 | 115aa9b3 |
15 | a2c3d8b |
hex | 6eab771 |
116045681 has 2 divisors, whose sum is σ = 116045682. Its totient is φ = 116045680.
The previous prime is 116045647. The next prime is 116045687. The reversal of 116045681 is 186540611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61152400 + 54893281 = 7820^2 + 7409^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116045681 is a prime.
It is a super-2 number, since 2×1160456812 = 26933200157507522, which contains 22 as substring.
It is a Chen prime.
It is equal to p6629045 and since 116045681 and 6629045 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (116045687) 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, 58022840 + 58022841.
It is an arithmetic number, because the mean of its divisors is an integer number (58022841).
Almost surely, 2116045681 is an apocalyptic number.
It is an amenable number.
116045681 is a deficient number, since it is larger than the sum of its proper divisors (1).
116045681 is an equidigital number, since it uses as much as digits as its factorization.
116045681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 32.
The square root of 116045681 is about 10772.4500927134. The cubic root of 116045681 is about 487.7639067256.
The spelling of 116045681 in words is "one hundred sixteen million, forty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •