Base | Representation |
---|---|
bin | 1001000110000101010011… |
… | …00010000100100000001101 |
3 | 2121211000001011101210002210 |
4 | 10203002221202010200031 |
5 | 10110140413233323041 |
6 | 110311545350141033 |
7 | 4132652620052544 |
oct | 443025142044015 |
9 | 77730034353083 |
10 | 20000212011021 |
11 | 6411051304060 |
12 | 22b0212651779 |
13 | b210201b5048 |
14 | 4d203048915b |
15 | 24a3b87b4016 |
hex | 1230a988480d |
20000212011021 has 64 divisors (see below), whose sum is σ = 29308115865600. Its totient is φ = 12031358976000.
The previous prime is 20000212010971. The next prime is 20000212011029. The reversal of 20000212011021 is 12011021200002.
It is not a de Polignac number, because 20000212011021 - 219 = 20000211486733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20000212010988 and 20000212011006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000212011029) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4181517996 + ... + 4181522778.
It is an arithmetic number, because the mean of its divisors is an integer number (457939310400).
Almost surely, 220000212011021 is an apocalyptic number.
It is an amenable number.
20000212011021 is a deficient number, since it is larger than the sum of its proper divisors (9307903854579).
20000212011021 is a wasteful number, since it uses less digits than its factorization.
20000212011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6658.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20000212011021 its reverse (12011021200002), we get a palindrome (32011233211023).
It can be divided in two parts, 200002 and 12011021, that multiplied together give a palindrome (2402228222042).
The spelling of 20000212011021 in words is "twenty trillion, two hundred twelve million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •