Base | Representation |
---|---|
bin | 1010001001111110101001… |
… | …0001110110100010000000 |
3 | 1110112111211002220021111121 |
4 | 2202133222101312202000 |
5 | 2430423043420110111 |
6 | 35425501551522024 |
7 | 2231520350412004 |
oct | 242375221664200 |
9 | 43474732807447 |
10 | 11166550550656 |
11 | 36157867467a6 |
12 | 130419b229314 |
13 | 630002830747 |
14 | 2a866d04c704 |
15 | 145703280871 |
hex | a27ea476880 |
11166550550656 has 32 divisors (see below), whose sum is σ = 23012961137100. Its totient is φ = 5390748539904.
The previous prime is 11166550550633. The next prime is 11166550550671. The reversal of 11166550550656 is 65605505566111.
It can be written as a sum of positive squares in 2 ways, for example, as 11059349313600 + 107201237056 = 3325560^2 + 327416^2 .
It is a tau number, because it is divible by the number of its divisors (32).
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 3 ways as a sum of consecutive naturals, for example, 1504111395 + ... + 1504118818.
Almost surely, 211166550550656 is an apocalyptic number.
11166550550656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11166550550656 is an abundant number, since it is smaller than the sum of its proper divisors (11846410586444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11166550550656 is an equidigital number, since it uses as much as digits as its factorization.
11166550550656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3008230256 (or 3008230244 counting only the distinct ones).
The product of its (nonzero) digits is 4050000, while the sum is 52.
The spelling of 11166550550656 in words is "eleven trillion, one hundred sixty-six billion, five hundred fifty million, five hundred fifty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •