Base | Representation |
---|---|
bin | 1010001000101001000010… |
… | …1100000110011100011100 |
3 | 1110110022111201220202120020 |
4 | 2202022100230012130130 |
5 | 2430034014044130120 |
6 | 35411141523352140 |
7 | 2230045055425230 |
oct | 242122054063434 |
9 | 43408451822506 |
10 | 11143572645660 |
11 | 3606a65278674 |
12 | 12bb847b22650 |
13 | 62aab0209460 |
14 | 2a74cd4725c0 |
15 | 144d0ad87640 |
hex | a2290b0671c |
11143572645660 has 96 divisors (see below), whose sum is σ = 38402465751552. Its totient is φ = 2351171370240.
The previous prime is 11143572645649. The next prime is 11143572645719. The reversal of 11143572645660 is 6654627534111.
It is a super-2 number, since 2×111435726456602 (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 (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1020468226 + ... + 1020479145.
It is an arithmetic number, because the mean of its divisors is an integer number (400025684912).
Almost surely, 211143572645660 is an apocalyptic number.
11143572645660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11143572645660 is an abundant number, since it is smaller than the sum of its proper divisors (27258893105892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11143572645660 is a wasteful number, since it uses less digits than its factorization.
11143572645660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2040947403 (or 2040947401 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 51.
The spelling of 11143572645660 in words is "eleven trillion, one hundred forty-three billion, five hundred seventy-two million, six hundred forty-five thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •