Base | Representation |
---|---|
bin | 110110010100110001… |
… | …0110011000111110100 |
3 | 102011010022110011210212 |
4 | 1230221202303013310 |
5 | 3402410220331030 |
6 | 125332100204552 |
7 | 11266654014026 |
oct | 1545142630764 |
9 | 364108404725 |
10 | 116661105140 |
11 | 45526174a88 |
12 | 1a739699758 |
13 | b002537538 |
14 | 5909b24016 |
15 | 307bcbd595 |
hex | 1b298b31f4 |
116661105140 has 24 divisors (see below), whose sum is σ = 245062541472. Its totient is φ = 46650304800.
The previous prime is 116661105139. The next prime is 116661105247. The reversal of 116661105140 is 41501166611.
It is a super-2 number, since 2×1166611051402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116661105097 and 116661105106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 815786 + ... + 948065.
It is an arithmetic number, because the mean of its divisors is an integer number (10210939228).
Almost surely, 2116661105140 is an apocalyptic number.
116661105140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116661105140 is an abundant number, since it is smaller than the sum of its proper divisors (128401436332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116661105140 is a wasteful number, since it uses less digits than its factorization.
116661105140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1767167 (or 1767165 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 116661105140 in words is "one hundred sixteen billion, six hundred sixty-one million, one hundred five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •