Base | Representation |
---|---|
bin | 110010000001100100011000… |
… | …100001100110101100000000 |
3 | 1001211222202112221002202002001 |
4 | 302001210120201212230000 |
5 | 212314121201431400000 |
6 | 2055531125541433344 |
7 | 64225130440201552 |
oct | 6201443041465400 |
9 | 1054882487082061 |
10 | 220010111200000 |
11 | 64113845136620 |
12 | 2081352510b854 |
13 | 959bb312c56a4 |
14 | 3c48790aad4d2 |
15 | 1a67e7b94b46a |
hex | c81918866b00 |
220010111200000 has 216 divisors, whose sum is σ = 598817344330800. Its totient is φ = 80003673600000.
The previous prime is 220010111199943. The next prime is 220010111200027. The reversal of 220010111200000 is 2111010022.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 220010111200000.
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, 3700575 + ... + 21300574.
It is an arithmetic number, because the mean of its divisors is an integer number (2772302520050).
Almost surely, 2220010111200000 is an apocalyptic number.
220010111200000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220010111200000 is an abundant number, since it is smaller than the sum of its proper divisors (378807233130800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220010111200000 is an frugal number, since it uses more digits than its factorization.
220010111200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25001201 (or 25001167 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 220010111200000 its reverse (2111010022), we get a palindrome (220012222210022).
The spelling of 220010111200000 in words is "two hundred twenty trillion, ten billion, one hundred eleven million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •