Base | Representation |
---|---|
bin | 1010100111000101101010… |
… | …0101111001011110010000 |
3 | 1112022022122222020101210120 |
4 | 2221301122211321132100 |
5 | 3012121300132410422 |
6 | 40451330245230240 |
7 | 2312613326535006 |
oct | 251613245713620 |
9 | 45268588211716 |
10 | 11666651060112 |
11 | 3798887413464 |
12 | 13850a9a02380 |
13 | 66821173cb69 |
14 | 2c4951756a76 |
15 | 153722b1945c |
hex | a9c5a979790 |
11666651060112 has 20 divisors (see below), whose sum is σ = 30138848572080. Its totient is φ = 3888883686688.
The previous prime is 11666651060089. The next prime is 11666651060123. The reversal of 11666651060112 is 21106015666611.
11666651060112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×116666510601122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 121527615162 + ... + 121527615257.
It is an arithmetic number, because the mean of its divisors is an integer number (1506942428604).
Almost surely, 211666651060112 is an apocalyptic number.
11666651060112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11666651060112 is an abundant number, since it is smaller than the sum of its proper divisors (18472197511968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11666651060112 is a wasteful number, since it uses less digits than its factorization.
11666651060112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243055230430 (or 243055230424 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 42.
The spelling of 11666651060112 in words is "eleven trillion, six hundred sixty-six billion, six hundred fifty-one million, sixty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •