Base | Representation |
---|---|
bin | 1010000000010010011001… |
… | …10011010110110010010000 |
3 | 2212220012010120012211002010 |
4 | 11000021030303112302100 |
5 | 10340422211410134300 |
6 | 114442413402422520 |
7 | 4430312155133634 |
oct | 500111463266220 |
9 | 85805116184063 |
10 | 22000111021200 |
11 | 7012216147784 |
12 | 2573928801a40 |
13 | c377a884a210 |
14 | 560b4d76adc4 |
15 | 282417993a50 |
hex | 14024ccd6c90 |
22000111021200 has 120 divisors (see below), whose sum is σ = 75894742022848. Its totient is φ = 5415411939840.
The previous prime is 22000111021193. The next prime is 22000111021237. The reversal of 22000111021200 is 212011100022.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 705116164 + ... + 705147363.
Almost surely, 222000111021200 is an apocalyptic number.
22000111021200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22000111021200 is an abundant number, since it is smaller than the sum of its proper divisors (53894631001648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22000111021200 is a wasteful number, since it uses less digits than its factorization.
22000111021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1410263561 (or 1410263550 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 22000111021200 its reverse (212011100022), we get a palindrome (22212122121222).
The spelling of 22000111021200 in words is "twenty-two trillion, one hundred eleven million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •