Base | Representation |
---|---|
bin | 1100010010011101000… |
… | …0011000001010101100 |
3 | 202011220202110212220012 |
4 | 3010213100120022230 |
5 | 11424324133032340 |
6 | 240552234512352 |
7 | 21152360260640 |
oct | 3044720301254 |
9 | 664822425805 |
10 | 211112002220 |
11 | 81594248a09 |
12 | 34ab8b956b8 |
13 | 16ba5500312 |
14 | a309bc8c20 |
15 | 5758c89565 |
hex | 31274182ac |
211112002220 has 24 divisors (see below), whose sum is σ = 506668805664. Its totient is φ = 72381257856.
The previous prime is 211112002187. The next prime is 211112002223. The reversal of 211112002220 is 22200211112.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 211112002195 and 211112002204.
It is not an unprimeable number, because it can be changed into a prime (211112002223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 753971297 + ... + 753971576.
It is an arithmetic number, because the mean of its divisors is an integer number (21111200236).
Almost surely, 2211112002220 is an apocalyptic number.
211112002220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211112002220 is an abundant number, since it is smaller than the sum of its proper divisors (295556803444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211112002220 is a wasteful number, since it uses less digits than its factorization.
211112002220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1507942889 (or 1507942887 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 211112002220 its reverse (22200211112), we get a palindrome (233312213332).
The spelling of 211112002220 in words is "two hundred eleven billion, one hundred twelve million, two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •