Base | Representation |
---|---|
bin | 110010000100010111000110… |
… | …100101110110100010010100 |
3 | 1001212200002212200202102101210 |
4 | 302010113012211312202110 |
5 | 212330242204042010400 |
6 | 2100155223521221420 |
7 | 64245033042053634 |
oct | 6204270645664224 |
9 | 1055602780672353 |
10 | 220202010110100 |
11 | 6418816a063aa7 |
12 | 2084475b791870 |
13 | 95b3c64168b35 |
14 | 3c53b96cd06c4 |
15 | 1a6ce5daa7950 |
hex | c845c6976894 |
220202010110100 has 72 divisors (see below), whose sum is σ = 637127752290400. Its totient is φ = 58719620234880.
The previous prime is 220202010110051. The next prime is 220202010110111. The reversal of 220202010110100 is 1011010202022.
It is a super-2 number, since 2×2202020101101002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
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, 13653426 + ... + 25036374.
Almost surely, 2220202010110100 is an apocalyptic number.
220202010110100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220202010110100 is an abundant number, since it is smaller than the sum of its proper divisors (416925742180300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220202010110100 is a wasteful number, since it uses less digits than its factorization.
220202010110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11447449 (or 11447442 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 220202010110100 its reverse (1011010202022), we get a palindrome (221213020312122).
The spelling of 220202010110100 in words is "two hundred twenty trillion, two hundred two billion, ten million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •