Base | Representation |
---|---|
bin | 1010100111000110000000… |
… | …1111100000111010101100 |
3 | 1112022022220120121111211210 |
4 | 2221301200033200322230 |
5 | 3012121443414340120 |
6 | 40451343513114420 |
7 | 2312615560352610 |
oct | 251614017407254 |
9 | 45268816544753 |
10 | 11666745855660 |
11 | 379892597a795 |
12 | 13851156b8a10 |
13 | 6682282807bc |
14 | 2c4960191340 |
15 | 15372b0e1ce0 |
hex | a9c603e0eac |
11666745855660 has 96 divisors (see below), whose sum is σ = 39529680099840. Its totient is φ = 2509820955648.
The previous prime is 11666745855629. The next prime is 11666745855701. The reversal of 11666745855660 is 6655854766611.
It is a happy number.
It is a super-2 number, since 2×116667458556602 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11666745855591 and 11666745855600.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 816991870 + ... + 817006149.
It is an arithmetic number, because the mean of its divisors is an integer number (411767501040).
Almost surely, 211666745855660 is an apocalyptic number.
11666745855660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11666745855660 is an abundant number, since it is smaller than the sum of its proper divisors (27862934244180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11666745855660 is a wasteful number, since it uses less digits than its factorization.
11666745855660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1633998055 (or 1633998053 counting only the distinct ones).
The product of its (nonzero) digits is 217728000, while the sum is 66.
The spelling of 11666745855660 in words is "eleven trillion, six hundred sixty-six billion, seven hundred forty-five million, eight hundred fifty-five thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •