Base | Representation |
---|---|
bin | 1100110011101001000… |
… | …1100011001000111000 |
3 | 210000220122100102102100 |
4 | 3030322101203020320 |
5 | 12101100334323000 |
6 | 245024245503400 |
7 | 21616216510320 |
oct | 3147221431070 |
9 | 700818312370 |
10 | 220021011000 |
11 | 8534614108a |
12 | 36784711b60 |
13 | 1799517244b |
14 | a9130b6280 |
15 | 5acae90a00 |
hex | 333a463238 |
220021011000 has 192 divisors, whose sum is σ = 849909977280. Its totient is φ = 50290502400.
The previous prime is 220021010981. The next prime is 220021011013. The reversal of 220021011000 is 110120022.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 1683199 + ... + 1809198.
It is an arithmetic number, because the mean of its divisors is an integer number (4426614465).
Almost surely, 2220021011000 is an apocalyptic number.
220021011000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220021011000 is an abundant number, since it is smaller than the sum of its proper divisors (629888966280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220021011000 is a wasteful number, since it uses less digits than its factorization.
220021011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3492431 (or 3492414 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 220021011000 its reverse (110120022), we get a palindrome (220131131022).
The spelling of 220021011000 in words is "two hundred twenty billion, twenty-one million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •