Base | Representation |
---|---|
bin | 10011101010111110… |
… | …011101001100001100 |
3 | 2000112000222101002112 |
4 | 103222332131030030 |
5 | 321224230011340 |
6 | 13411532043152 |
7 | 1345265655161 |
oct | 235276351414 |
9 | 60460871075 |
10 | 21122110220 |
11 | 8a59976042 |
12 | 41159034b8 |
13 | 1cb7cca393 |
14 | 104533c068 |
15 | 83951d065 |
hex | 4eaf9d30c |
21122110220 has 24 divisors (see below), whose sum is σ = 45438297408. Its totient is φ = 8242774400.
The previous prime is 21122110199. The next prime is 21122110277. The reversal of 21122110220 is 2201122112.
It is a super-2 number, since 2×211221102202 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21122110195 and 21122110204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12878516 + ... + 12880155.
It is an arithmetic number, because the mean of its divisors is an integer number (1893262392).
Almost surely, 221122110220 is an apocalyptic number.
21122110220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21122110220 is an abundant number, since it is smaller than the sum of its proper divisors (24316187188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21122110220 is a wasteful number, since it uses less digits than its factorization.
21122110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25758721 (or 25758719 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21122110220 its reverse (2201122112), we get a palindrome (23323232332).
The spelling of 21122110220 in words is "twenty-one billion, one hundred twenty-two million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •