Base | Representation |
---|---|
bin | 1010001101000110001000… |
… | …0110101101101010001000 |
3 | 1110201122001002120202220100 |
4 | 2203101202012231222020 |
5 | 2432312231212113300 |
6 | 35510235405125400 |
7 | 2235424356456360 |
oct | 243214206555210 |
9 | 43648032522810 |
10 | 11220100504200 |
11 | 3636466255455 |
12 | 1312644b59860 |
13 | 635087ba9ca3 |
14 | 2ab0ad0219a0 |
15 | 146cd95ed700 |
hex | a34621ada88 |
11220100504200 has 144 divisors (see below), whose sum is σ = 43063814364480. Its totient is φ = 2564594398080.
The previous prime is 11220100504183. The next prime is 11220100504213. The reversal of 11220100504200 is 240500102211.
11220100504200 is a `hidden beast` number, since 11 + 220 + 10 + 0 + 5 + 0 + 420 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 445229484 + ... + 445254683.
It is an arithmetic number, because the mean of its divisors is an integer number (299054266420).
Almost surely, 211220100504200 is an apocalyptic number.
11220100504200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11220100504200 is an abundant number, since it is smaller than the sum of its proper divisors (31843713860280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220100504200 is a wasteful number, since it uses less digits than its factorization.
11220100504200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 890484196 (or 890484184 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 11220100504200 its reverse (240500102211), we get a palindrome (11460600606411).
The spelling of 11220100504200 in words is "eleven trillion, two hundred twenty billion, one hundred million, five hundred four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •