Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …1100010000100001101000 |
3 | 1110100020000011111201020220 |
4 | 2201230020130100201220 |
5 | 2424021240314121300 |
6 | 35344231441250040 |
7 | 2224521303564021 |
oct | 241541034204150 |
9 | 43306004451226 |
10 | 11111222020200 |
11 | 35a4274185975 |
12 | 12b5519933920 |
13 | 627a25b55223 |
14 | 2a5b00b7bc48 |
15 | 144065bdbda0 |
hex | a1b08710868 |
11111222020200 has 96 divisors (see below), whose sum is σ = 34448594062560. Its totient is φ = 2962665158400.
The previous prime is 11111222020189. The next prime is 11111222020247. The reversal of 11111222020200 is 202022211111.
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 11111222020200.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4436082 + ... + 6473118.
It is an arithmetic number, because the mean of its divisors is an integer number (358839521485).
Almost surely, 211111222020200 is an apocalyptic number.
11111222020200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11111222020200 is an abundant number, since it is smaller than the sum of its proper divisors (23337372042360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111222020200 is a wasteful number, since it uses less digits than its factorization.
11111222020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2046147 (or 2046138 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11111222020200 its reverse (202022211111), we get a palindrome (11313244231311).
The spelling of 11111222020200 in words is "eleven trillion, one hundred eleven billion, two hundred twenty-two million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •