Base | Representation |
---|---|
bin | 1001001001100100011011… |
… | …00000111000010001011101 |
3 | 2122020110020110112222201210 |
4 | 10210302031200320101131 |
5 | 10114121230230133041 |
6 | 110443000104255033 |
7 | 4144423244616006 |
oct | 444621540702135 |
9 | 78213213488653 |
10 | 20120001021021 |
11 | 645793205a280 |
12 | 230b483771479 |
13 | b2c400767a55 |
14 | 4d7b5578c1ad |
15 | 24d579e8e016 |
hex | 124c8d83845d |
20120001021021 has 16 divisors (see below), whose sum is σ = 30805743191040. Its totient is φ = 11552153695920.
The previous prime is 20120001021019. The next prime is 20120001021089. The reversal of 20120001021021 is 12012010002102.
It is not a de Polignac number, because 20120001021021 - 21 = 20120001021019 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20120001020988 and 20120001021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120001021821) 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, 16044657285 + ... + 16044658538.
It is an arithmetic number, because the mean of its divisors is an integer number (1925358949440).
Almost surely, 220120001021021 is an apocalyptic number.
It is an amenable number.
20120001021021 is a deficient number, since it is larger than the sum of its proper divisors (10685742170019).
20120001021021 is a wasteful number, since it uses less digits than its factorization.
20120001021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32089315856.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20120001021021 its reverse (12012010002102), we get a palindrome (32132011023123).
The spelling of 20120001021021 in words is "twenty trillion, one hundred twenty billion, one million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •