Base | Representation |
---|---|
bin | 1001000110000110110001… |
… | …01000000110011100111101 |
3 | 2121211002002020010112021010 |
4 | 10203003120220012130331 |
5 | 10110144023020333041 |
6 | 110312200013025433 |
7 | 4133011322635335 |
oct | 443033050063475 |
9 | 77732066115233 |
10 | 20001002121021 |
11 | 64114172aa429 |
12 | 22b03b3185279 |
13 | b21117ab445c |
14 | 4d20a739c0c5 |
15 | 24a412d35a16 |
hex | 1230d8a0673d |
20001002121021 has 8 divisors (see below), whose sum is σ = 28071581924320. Its totient is φ = 12632211865872.
The previous prime is 20001002120989. The next prime is 20001002121031. The reversal of 20001002121021 is 12012120010002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20001002121021 - 25 = 20001002120989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20001002120988 and 20001002121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001002121031) 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, 175447386970 + ... + 175447387083.
It is an arithmetic number, because the mean of its divisors is an integer number (3508947740540).
Almost surely, 220001002121021 is an apocalyptic number.
It is an amenable number.
20001002121021 is a deficient number, since it is larger than the sum of its proper divisors (8070579803299).
20001002121021 is a wasteful number, since it uses less digits than its factorization.
20001002121021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 350894774075.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20001002121021 its reverse (12012120010002), we get a palindrome (32013122131023).
The spelling of 20001002121021 in words is "twenty trillion, one billion, two million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •