Base | Representation |
---|---|
bin | 11101011010011001101… |
… | …000101001110100011100 |
3 | 21011020002202100021022021 |
4 | 131122121220221310130 |
5 | 231103420310401340 |
6 | 4144310532025524 |
7 | 266012344142263 |
oct | 35323150516434 |
9 | 7136082307267 |
10 | 2021212200220 |
11 | 70a211659874 |
12 | 287883a622a4 |
13 | 1187a4115635 |
14 | 6db81b5d5da |
15 | 3789a393e4a |
hex | 1d699a29d1c |
2021212200220 has 24 divisors (see below), whose sum is σ = 4253261340384. Its totient is φ = 806824742976.
The previous prime is 2021212200193. The next prime is 2021212200221. The reversal of 2021212200220 is 220022121202.
It is a junction number, because it is equal to n+sod(n) for n = 2021212200194 and 2021212200203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2021212200221) 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, 103748587 + ... + 103768066.
It is an arithmetic number, because the mean of its divisors is an integer number (177219222516).
Almost surely, 22021212200220 is an apocalyptic number.
2021212200220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2021212200220 is an abundant number, since it is smaller than the sum of its proper divisors (2232049140164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2021212200220 is a wasteful number, since it uses less digits than its factorization.
2021212200220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207517149 (or 207517147 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 2021212200220 its reverse (220022121202), we get a palindrome (2241234321422).
The spelling of 2021212200220 in words is "two trillion, twenty-one billion, two hundred twelve million, two hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •