Base | Representation |
---|---|
bin | 110000001111111010101010… |
… | …111011110001001110011100 |
3 | 1000211100010100101102122000121 |
4 | 300033322222323301032130 |
5 | 210303141121114133040 |
6 | 2031151202213404324 |
7 | 62460642235421335 |
oct | 6017725273611634 |
9 | 1024303311378017 |
10 | 212200022021020 |
11 | 6168258442a040 |
12 | 1b9719520396a4 |
13 | 91534b770ac07 |
14 | 3a587705b728c |
15 | 197ec22333c4a |
hex | c0feaaef139c |
212200022021020 has 48 divisors (see below), whose sum is σ = 486566171346528. Its totient is φ = 77094563132160.
The previous prime is 212200022021003. The next prime is 212200022021033. The reversal of 212200022021020 is 20120220002212.
It is a junction number, because it is equal to n+sod(n) for n = 212200022020985 and 212200022021003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 431511447 + ... + 432002926.
It is an arithmetic number, because the mean of its divisors is an integer number (10136795236386).
Almost surely, 2212200022021020 is an apocalyptic number.
212200022021020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212200022021020 is an abundant number, since it is smaller than the sum of its proper divisors (274366149325508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212200022021020 is a wasteful number, since it uses less digits than its factorization.
212200022021020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863515510 (or 863515508 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 212200022021020 its reverse (20120220002212), we get a palindrome (232320242023232).
The spelling of 212200022021020 in words is "two hundred twelve trillion, two hundred billion, twenty-two million, twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •