Base | Representation |
---|---|
bin | 1101110101001… |
… | …11110001101001 |
3 | 22002022222000111 |
4 | 12322213301221 |
5 | 214200434234 |
6 | 15302534321 |
7 | 2606146354 |
oct | 672476151 |
9 | 262288014 |
10 | 116030569 |
11 | 5a550536 |
12 | 32a373a1 |
13 | 1b067255 |
14 | 115a529b |
15 | a2be664 |
hex | 6ea7c69 |
116030569 has 2 divisors, whose sum is σ = 116030570. Its totient is φ = 116030568.
The previous prime is 116030567. The next prime is 116030599. The reversal of 116030569 is 965030611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112466025 + 3564544 = 10605^2 + 1888^2 .
It is a cyclic number.
It is not a de Polignac number, because 116030569 - 21 = 116030567 is a prime.
It is a super-2 number, since 2×1160305692 = 26926185884927522, which contains 22 as substring.
Together with 116030567, it forms a pair of twin primes.
It is equal to p6628243 and since 116030569 and 6628243 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116030569.
It is not a weakly prime, because it can be changed into another prime (116030567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58015284 + 58015285.
It is an arithmetic number, because the mean of its divisors is an integer number (58015285).
Almost surely, 2116030569 is an apocalyptic number.
It is an amenable number.
116030569 is a deficient number, since it is larger than the sum of its proper divisors (1).
116030569 is an equidigital number, since it uses as much as digits as its factorization.
116030569 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 116030569 is about 10771.7486509851. The cubic root of 116030569 is about 487.7427328565.
The spelling of 116030569 in words is "one hundred sixteen million, thirty thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •