Base | Representation |
---|---|
bin | 1010000001011101011111… |
… | …0001001111000000011000 |
3 | 1110000112002110110001202220 |
4 | 2200113113301033000120 |
5 | 2421023343021402300 |
6 | 35234340510024040 |
7 | 2215120050660000 |
oct | 240272761170030 |
9 | 43015073401686 |
10 | 11020211122200 |
11 | 3569710978195 |
12 | 129b95a4a8020 |
13 | 61c28077b567 |
14 | 2a15498d7000 |
15 | 1419dac29da0 |
hex | a05d7c4f018 |
11020211122200 has 240 divisors, whose sum is σ = 39854064016680. Its totient is φ = 2518905070080.
The previous prime is 11020211122199. The next prime is 11020211122223. The reversal of 11020211122200 is 222111202011.
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 11020211122200.
It is a congruent number.
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 59 ways as a sum of consecutive naturals, for example, 2384269 + ... + 5265468.
Almost surely, 211020211122200 is an apocalyptic number.
11020211122200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020211122200 is an abundant number, since it is smaller than the sum of its proper divisors (28833852894480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020211122200 is an equidigital number, since it uses as much as digits as its factorization.
11020211122200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7649784 (or 7649754 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11020211122200 its reverse (222111202011), we get a palindrome (11242322324211).
The spelling of 11020211122200 in words is "eleven trillion, twenty billion, two hundred eleven million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •