Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …10110110100011100111101 |
3 | 2121211011201020022222212102 |
4 | 10203010111112310130331 |
5 | 10110203114334013041 |
6 | 110312445051114445 |
7 | 4133045504162063 |
oct | 443042526643475 |
9 | 77734636288772 |
10 | 20002021001021 |
11 | 641189a449014 |
12 | 22b0638442a25 |
13 | b2124ac02027 |
14 | 4d2162822033 |
15 | 24a4724e609b |
hex | 1231155b473d |
20002021001021 has 8 divisors (see below), whose sum is σ = 20009607340800. Its totient is φ = 19994435015040.
The previous prime is 20002021000979. The next prime is 20002021001051. The reversal of 20002021001021 is 12010012020002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20002021001021 - 238 = 19727143094077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20002021000993 and 20002021001011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002021001051) 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, 183515981 + ... + 183624941.
It is an arithmetic number, because the mean of its divisors is an integer number (2501200917600).
Almost surely, 220002021001021 is an apocalyptic number.
It is an amenable number.
20002021001021 is a deficient number, since it is larger than the sum of its proper divisors (7586339779).
20002021001021 is a wasteful number, since it uses less digits than its factorization.
20002021001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176899.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20002021001021 its reverse (12010012020002), we get a palindrome (32012033021023).
The spelling of 20002021001021 in words is "twenty trillion, two billion, twenty-one million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •