Base | Representation |
---|---|
bin | 1101111001100… |
… | …10100011011101 |
3 | 22010101211202200 |
4 | 12330302203131 |
5 | 214322132010 |
6 | 15323042113 |
7 | 2614034535 |
oct | 674624335 |
9 | 263354680 |
10 | 116599005 |
11 | 5a8a9616 |
12 | 33070339 |
13 | 1b205bc3 |
14 | 116b24c5 |
15 | a382cc0 |
hex | 6f328dd |
116599005 has 24 divisors (see below), whose sum is σ = 213994872. Its totient is φ = 58527744.
The previous prime is 116598997. The next prime is 116599013. The reversal of 116599005 is 500995611.
It is an interprime number because it is at equal distance from previous prime (116598997) and next prime (116599013).
It can be written as a sum of positive squares in 4 ways, for example, as 5212089 + 111386916 = 2283^2 + 10554^2 .
It is not a de Polignac number, because 116599005 - 23 = 116598997 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 75444 + ... + 76973.
It is an arithmetic number, because the mean of its divisors is an integer number (8916453).
Almost surely, 2116599005 is an apocalyptic number.
116599005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116599005 is a deficient number, since it is larger than the sum of its proper divisors (97395867).
116599005 is a wasteful number, since it uses less digits than its factorization.
116599005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152445 (or 152442 counting only the distinct ones).
The product of its (nonzero) digits is 12150, while the sum is 36.
The square root of 116599005 is about 10798.1019165407. The cubic root of 116599005 is about 488.5379227415.
The spelling of 116599005 in words is "one hundred sixteen million, five hundred ninety-nine thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •