Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …1110010001001110001000 |
3 | 1110000121102020211111200012 |
4 | 2200120031132101032020 |
5 | 2421032214200321300 |
6 | 35235010133331052 |
7 | 2215151301223220 |
oct | 240301536211610 |
9 | 43017366744605 |
10 | 11021112120200 |
11 | 356a033521336 |
12 | 129bb70196a88 |
13 | 61c395334280 |
14 | 2a15d3433080 |
15 | 141a3eda2435 |
hex | a060d791388 |
11021112120200 has 96 divisors (see below), whose sum is σ = 31537336272960. Its totient is φ = 3488000313600.
The previous prime is 11021112120197. The next prime is 11021112120229. The reversal of 11021112120200 is 202121112011.
It is a Harshad number since it is a multiple of its sum of digits (14).
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 23 ways as a sum of consecutive naturals, for example, 302759606 + ... + 302796005.
It is an arithmetic number, because the mean of its divisors is an integer number (328513919510).
Almost surely, 211021112120200 is an apocalyptic number.
11021112120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11021112120200 is an abundant number, since it is smaller than the sum of its proper divisors (20516224152760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021112120200 is a wasteful number, since it uses less digits than its factorization.
11021112120200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605555647 (or 605555638 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11021112120200 its reverse (202121112011), we get a palindrome (11223233232211).
The spelling of 11021112120200 in words is "eleven trillion, twenty-one billion, one hundred twelve million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •