Base | Representation |
---|---|
bin | 1001100110011100010111… |
… | …11000111010001011000000 |
3 | 2202202022001022220112211021 |
4 | 10303032023320322023000 |
5 | 10231400100432224300 |
6 | 112522434152555224 |
7 | 4306204540241032 |
oct | 463161370721300 |
9 | 82668038815737 |
10 | 21112111211200 |
11 | 67aa661429289 |
12 | 244b8033b2b14 |
13 | ba1b2c291269 |
14 | 52db90011c52 |
15 | 269293c23d1a |
hex | 13338be3a2c0 |
21112111211200 has 84 divisors (see below), whose sum is σ = 52142108628960. Its totient is φ = 8413450839040.
The previous prime is 21112111211111. The next prime is 21112111211207. The reversal of 21112111211200 is 211211121112.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (21112111211207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24095752 + ... + 24956551.
It is an arithmetic number, because the mean of its divisors is an integer number (620739388440).
Almost surely, 221112111211200 is an apocalyptic number.
21112111211200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21112111211200 is an abundant number, since it is smaller than the sum of its proper divisors (31029997417760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112111211200 is a wasteful number, since it uses less digits than its factorization.
21112111211200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49052594 (or 49052579 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 21112111211200 its reverse (211211121112), we get a palindrome (21323322332312).
The spelling of 21112111211200 in words is "twenty-one trillion, one hundred twelve billion, one hundred eleven million, two hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •