Base | Representation |
---|---|
bin | 10010110101001101… |
… | …111111000000010100 |
3 | 1221012011220011020212 |
4 | 102311031333000110 |
5 | 312402333224340 |
6 | 13142233144552 |
7 | 1314034650056 |
oct | 226515770024 |
9 | 57164804225 |
10 | 20220211220 |
11 | 8636866a70 |
12 | 3b0385b158 |
13 | 1ba31ba531 |
14 | d9b6498d6 |
15 | 7d5268a65 |
hex | 4b537f014 |
20220211220 has 48 divisors (see below), whose sum is σ = 47308278528. Its totient is φ = 7196357760.
The previous prime is 20220211183. The next prime is 20220211223. The reversal of 20220211220 is 2211202202.
It is a junction number, because it is equal to n+sod(n) for n = 20220211195 and 20220211204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220211223) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 967427 + ... + 988106.
It is an arithmetic number, because the mean of its divisors is an integer number (985589136).
Almost surely, 220220211220 is an apocalyptic number.
20220211220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20220211220 is an abundant number, since it is smaller than the sum of its proper divisors (27088067308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220211220 is a wasteful number, since it uses less digits than its factorization.
20220211220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1955600 (or 1955598 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 20220211220 its reverse (2211202202), we get a palindrome (22431413422).
The spelling of 20220211220 in words is "twenty billion, two hundred twenty million, two hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •