Base | Representation |
---|---|
bin | 1101110101011… |
… | …10011111010001 |
3 | 22002101100201212 |
4 | 12322232133101 |
5 | 214202324230 |
6 | 15303305505 |
7 | 2606322464 |
oct | 672563721 |
9 | 262340655 |
10 | 116058065 |
11 | 5a56a162 |
12 | 32a4b295 |
13 | 1b076916 |
14 | 115b12db |
15 | a2c7895 |
hex | 6eae7d1 |
116058065 has 12 divisors (see below), whose sum is σ = 147945756. Its totient is φ = 87383808.
The previous prime is 116058053. The next prime is 116058067. The reversal of 116058065 is 560850611.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 108241 + 115949824 = 329^2 + 10768^2 .
It is not a de Polignac number, because 116058065 - 24 = 116058049 is a prime.
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116058067) 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 in 11 ways as a sum of consecutive naturals, for example, 38714 + ... + 41603.
It is an arithmetic number, because the mean of its divisors is an integer number (12328813).
Almost surely, 2116058065 is an apocalyptic number.
It is an amenable number.
116058065 is a deficient number, since it is larger than the sum of its proper divisors (31887691).
116058065 is an equidigital number, since it uses as much as digits as its factorization.
116058065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80356 (or 80339 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 32.
The square root of 116058065 is about 10773.0248769786. The cubic root of 116058065 is about 487.7812569429.
The spelling of 116058065 in words is "one hundred sixteen million, fifty-eight thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •