Base | Representation |
---|---|
bin | 1010000000011110000111… |
… | …1101011001000100000100 |
3 | 1102221220012002011220111120 |
4 | 2200013201331121010010 |
5 | 2420234024231241400 |
6 | 35222445030033540 |
7 | 2213645415425550 |
oct | 240074175310404 |
9 | 42856162156446 |
10 | 11003202212100 |
11 | 356248288329a |
12 | 12985b21a88b0 |
13 | 61a79c988707 |
14 | 2a07b4978860 |
15 | 141342892ca0 |
hex | a01e1f59104 |
11003202212100 has 144 divisors (see below), whose sum is σ = 38298865382400. Its totient is φ = 2382648289920.
The previous prime is 11003202212083. The next prime is 11003202212131. The reversal of 11003202212100 is 121220230011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11003202212100.
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 47 ways as a sum of consecutive naturals, for example, 137844840 + ... + 137924639.
Almost surely, 211003202212100 is an apocalyptic number.
11003202212100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11003202212100 is an abundant number, since it is smaller than the sum of its proper divisors (27295663170300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003202212100 is a wasteful number, since it uses less digits than its factorization.
11003202212100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275769522 (or 275769515 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11003202212100 its reverse (121220230011), we get a palindrome (11124422442111).
The spelling of 11003202212100 in words is "eleven trillion, three billion, two hundred two million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •