Base | Representation |
---|---|
bin | 110000001101010011001100… |
… | …110001000101101001110101 |
3 | 1000210200221012100111022020120 |
4 | 300031103030301011221311 |
5 | 210242214332430120041 |
6 | 2030532422525322153 |
7 | 62441645142220242 |
oct | 6015231461055165 |
9 | 1023627170438216 |
10 | 212020201020021 |
11 | 61613298136519 |
12 | 1b942b28406359 |
13 | 913c55aba9a44 |
14 | 3a4db924945c9 |
15 | 197a1ea6d7366 |
hex | c0d4ccc45a75 |
212020201020021 has 8 divisors (see below), whose sum is σ = 283134621021504. Its totient is φ = 141126290849280.
The previous prime is 212020201019953. The next prime is 212020201020031. The reversal of 212020201020021 is 120020102020212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212020201020021 - 29 = 212020201019509 is a prime.
It is a super-2 number, since 2×2120202010200212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212020201020031) 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, 55127455441 + ... + 55127459286.
It is an arithmetic number, because the mean of its divisors is an integer number (35391827627688).
Almost surely, 2212020201020021 is an apocalyptic number.
It is an amenable number.
212020201020021 is a deficient number, since it is larger than the sum of its proper divisors (71114420001483).
212020201020021 is a wasteful number, since it uses less digits than its factorization.
212020201020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110254915371.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 212020201020021 its reverse (120020102020212), we get a palindrome (332040303040233).
The spelling of 212020201020021 in words is "two hundred twelve trillion, twenty billion, two hundred one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •