Base | Representation |
---|---|
bin | 1010000100001001000110… |
… | …0101111000111010001000 |
3 | 1110011220222222010101202020 |
4 | 2201002101211320322020 |
5 | 2422302214231230430 |
6 | 35311440023204440 |
7 | 2221340460144333 |
oct | 241022145707210 |
9 | 43156888111666 |
10 | 11066278383240 |
11 | 3587200717253 |
12 | 12a88762a6720 |
13 | 6237128197c2 |
14 | 2a3879bc161a |
15 | 142cd51d3b10 |
hex | a1091978e88 |
11066278383240 has 128 divisors (see below), whose sum is σ = 34271022412800. Its totient is φ = 2855709020160.
The previous prime is 11066278383227. The next prime is 11066278383257. The reversal of 11066278383240 is 4238387266011.
It is a happy number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 197552356 + ... + 197608364.
It is an arithmetic number, because the mean of its divisors is an integer number (267742362600).
Almost surely, 211066278383240 is an apocalyptic number.
11066278383240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11066278383240 is an abundant number, since it is smaller than the sum of its proper divisors (23204744029560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11066278383240 is a wasteful number, since it uses less digits than its factorization.
11066278383240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109167 (or 109163 counting only the distinct ones).
The product of its (nonzero) digits is 2322432, while the sum is 51.
The spelling of 11066278383240 in words is "eleven trillion, sixty-six billion, two hundred seventy-eight million, three hundred eighty-three thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •