Base | Representation |
---|---|
bin | 11101011010010011100… |
… | …011100101111010101100 |
3 | 21011012211122102122022212 |
4 | 131122103203211322230 |
5 | 231103213203211340 |
6 | 4144252450025552 |
7 | 266006665221323 |
oct | 35322343457254 |
9 | 7135748378285 |
10 | 2021110210220 |
11 | 70a16a029212 |
12 | 2878558782b8 |
13 | 118788c5611a |
14 | 6db723b10ba |
15 | 37891449a65 |
hex | 1d6938e5eac |
2021110210220 has 24 divisors (see below), whose sum is σ = 4261942785408. Its totient is φ = 805089542400.
The previous prime is 2021110210193. The next prime is 2021110210261. The reversal of 2021110210220 is 220120111202.
It is a junction number, because it is equal to n+sod(n) for n = 2021110210195 and 2021110210204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 209653916 + ... + 209663555.
It is an arithmetic number, because the mean of its divisors is an integer number (177580949392).
Almost surely, 22021110210220 is an apocalyptic number.
2021110210220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2021110210220 is an abundant number, since it is smaller than the sum of its proper divisors (2240832575188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2021110210220 is a wasteful number, since it uses less digits than its factorization.
2021110210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419317721 (or 419317719 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2021110210220 its reverse (220120111202), we get a palindrome (2241230321422).
The spelling of 2021110210220 in words is "two trillion, twenty-one billion, one hundred ten million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •