Base | Representation |
---|---|
bin | 1100010010000101001… |
… | …0111110011100110101 |
3 | 202011122210100021002210 |
4 | 3010201102332130311 |
5 | 11424123034120041 |
6 | 240534303524033 |
7 | 21150034401435 |
oct | 3044122763465 |
9 | 664583307083 |
10 | 211012020021 |
11 | 815428698a0 |
12 | 34a8b5b9619 |
13 | 16b8a89495a |
14 | a2da8002c5 |
15 | 57500da016 |
hex | 31214be735 |
211012020021 has 16 divisors (see below), whose sum is σ = 309965456448. Its totient is φ = 126619872000.
The previous prime is 211012020013. The next prime is 211012020031. The reversal of 211012020021 is 120020210112.
211012020021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 211012020021 - 23 = 211012020013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211012019979 and 211012020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211012020031) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 31651636 + ... + 31658301.
It is an arithmetic number, because the mean of its divisors is an integer number (19372841028).
Almost surely, 2211012020021 is an apocalyptic number.
It is an amenable number.
211012020021 is a deficient number, since it is larger than the sum of its proper divisors (98953436427).
211012020021 is a wasteful number, since it uses less digits than its factorization.
211012020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63310052.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 211012020021 its reverse (120020210112), we get a palindrome (331032230133).
The spelling of 211012020021 in words is "two hundred eleven billion, twelve million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •