Base | Representation |
---|---|
bin | 1010101100111010110111… |
… | …0101110100101000011000 |
3 | 1112122220020202100000000010 |
4 | 2223032231311310220120 |
5 | 3020241432442210240 |
6 | 41005335154241520 |
7 | 2323061031440520 |
oct | 253165565645030 |
9 | 45586222300003 |
10 | 11766831991320 |
11 | 382731599788a |
12 | 13a05a82862a0 |
13 | 6747b888b293 |
14 | 2c9736834680 |
15 | 156137b93280 |
hex | ab3add74a18 |
11766831991320 has 128 divisors (see below), whose sum is σ = 40346230947840. Its totient is φ = 2689374466560.
The previous prime is 11766831991303. The next prime is 11766831991349. The reversal of 11766831991320 is 2319913866711.
It is a super-2 number, since 2×117668319913202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 11776414 + ... + 12736466.
It is an arithmetic number, because the mean of its divisors is an integer number (315204929280).
Almost surely, 211766831991320 is an apocalyptic number.
11766831991320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11766831991320 is an abundant number, since it is smaller than the sum of its proper divisors (28579398956520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11766831991320 is a wasteful number, since it uses less digits than its factorization.
11766831991320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974665 (or 974661 counting only the distinct ones).
The product of its (nonzero) digits is 2939328, while the sum is 57.
The spelling of 11766831991320 in words is "eleven trillion, seven hundred sixty-six billion, eight hundred thirty-one million, nine hundred ninety-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •