Base | Representation |
---|---|
bin | 10100111001110001… |
… | …00010001001011100 |
3 | 1001222002011200021210 |
4 | 22130320202021130 |
5 | 140440313001340 |
6 | 5053314224420 |
7 | 545043266544 |
oct | 123470421134 |
9 | 31862150253 |
10 | 11222000220 |
11 | 4839587952 |
12 | 2212285110 |
13 | 109ac15622 |
14 | 78657c324 |
15 | 45a2e2180 |
hex | 29ce2225c |
11222000220 has 48 divisors (see below), whose sum is σ = 33269933088. Its totient is φ = 2816501760.
The previous prime is 11222000197. The next prime is 11222000221. The reversal of 11222000220 is 2200022211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11222000196 and 11222000205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222000221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5499961 + ... + 5502000.
It is an arithmetic number, because the mean of its divisors is an integer number (693123606).
Almost surely, 211222000220 is an apocalyptic number.
11222000220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11222000220 is an abundant number, since it is smaller than the sum of its proper divisors (22047932868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222000220 is a wasteful number, since it uses less digits than its factorization.
11222000220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11001990 (or 11001988 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 11222000220 its reverse (2200022211), we get a palindrome (13422022431).
The spelling of 11222000220 in words is "eleven billion, two hundred twenty-two million, two hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •