Base | Representation |
---|---|
bin | 1010000001100000110011… |
… | …0000111000011000110000 |
3 | 1110000121101102110000102010 |
4 | 2200120030300320120300 |
5 | 2421032203124101000 |
6 | 35235005030322520 |
7 | 2215151065126461 |
oct | 240301460703060 |
9 | 43017342400363 |
10 | 11021100222000 |
11 | 356a027835010 |
12 | 129bb681b9440 |
13 | 61c392a2970b |
14 | 2a15d1a16d68 |
15 | 141a3dd01d50 |
hex | a060cc38630 |
11021100222000 has 320 divisors, whose sum is σ = 40012612743168. Its totient is φ = 2585594880000.
The previous prime is 11021100221977. The next prime is 11021100222059. The reversal of 11021100222000 is 22200112011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 647329 + ... + 4739328.
Almost surely, 211021100222000 is an apocalyptic number.
11021100222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11021100222000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20006306371584).
11021100222000 is an abundant number, since it is smaller than the sum of its proper divisors (28991512521168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021100222000 is a wasteful number, since it uses less digits than its factorization.
11021100222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5386725 (or 5386709 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11021100222000 its reverse (22200112011), we get a palindrome (11043300334011).
The spelling of 11021100222000 in words is "eleven trillion, twenty-one billion, one hundred million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •