Base | Representation |
---|---|
bin | 1101111011000… |
… | …11011110110001 |
3 | 22010210000200001 |
4 | 12331203132301 |
5 | 214400040114 |
6 | 15331230001 |
7 | 2615531026 |
oct | 675433661 |
9 | 263700601 |
10 | 116799409 |
11 | 5aa26141 |
12 | 33148301 |
13 | 1b27619c |
14 | 1172554d |
15 | a3c2374 |
hex | 6f637b1 |
116799409 has 8 divisors (see below), whose sum is σ = 118974240. Its totient is φ = 114631200.
The previous prime is 116799407. The next prime is 116799427. The reversal of 116799409 is 904997611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116799409 - 21 = 116799407 is a prime.
It is a super-3 number, since 3×1167994093 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116799407) 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 7 ways as a sum of consecutive naturals, for example, 46629 + ... + 49069.
It is an arithmetic number, because the mean of its divisors is an integer number (14871780).
Almost surely, 2116799409 is an apocalyptic number.
It is an amenable number.
116799409 is a deficient number, since it is larger than the sum of its proper divisors (2174831).
116799409 is an equidigital number, since it uses as much as digits as its factorization.
116799409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3311.
The product of its (nonzero) digits is 122472, while the sum is 46.
The square root of 116799409 is about 10807.3775264862. The cubic root of 116799409 is about 488.8176533050.
It can be divided in two parts, 1167 and 99409, that added together give a triangular number (100576 = T448).
The spelling of 116799409 in words is "one hundred sixteen million, seven hundred ninety-nine thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •