Base | Representation |
---|---|
bin | 110110010100101111… |
… | …0111101101101000111 |
3 | 102011010020120002220011 |
4 | 1230221132331231013 |
5 | 3402404441144121 |
6 | 125332022451051 |
7 | 11266642326235 |
oct | 1545136755507 |
9 | 364106502804 |
10 | 116660099911 |
11 | 45525648813 |
12 | 1a739293a87 |
13 | b002274b24 |
14 | 5909941955 |
15 | 307bb707e1 |
hex | 1b297bdb47 |
116660099911 has 8 divisors (see below), whose sum is σ = 123795538560. Its totient is φ = 109696599672.
The previous prime is 116660099869. The next prime is 116660099939. The reversal of 116660099911 is 119990066611.
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 116660099911 - 29 = 116660099399 is a prime.
It is a super-2 number, since 2×1166600999112 (a number of 23 digits) contains 22 as substring.
116660099911 is a strobogrammatic number because it is the same when read upside-down.
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116660099951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42983205 + ... + 42985918.
It is an arithmetic number, because the mean of its divisors is an integer number (15474442320).
Almost surely, 2116660099911 is an apocalyptic number.
116660099911 is a deficient number, since it is larger than the sum of its proper divisors (7135438649).
116660099911 is an equidigital number, since it uses as much as digits as its factorization.
116660099911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85969205.
The product of its (nonzero) digits is 157464, while the sum is 49.
The spelling of 116660099911 in words is "one hundred sixteen billion, six hundred sixty million, ninety-nine thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •