Base | Representation |
---|---|
bin | 1001000110000110110011… |
… | …10000011111111111110101 |
3 | 2121211002010112211202120001 |
4 | 10203003121300133333311 |
5 | 10110144042400200041 |
6 | 110312201531511301 |
7 | 4133011643152603 |
oct | 443033160377765 |
9 | 77732115752501 |
10 | 20001021100021 |
11 | 6411426a92655 |
12 | 22b03b95b8531 |
13 | b2111b9cac30 |
14 | 4d20a9adc873 |
15 | 24a414834131 |
hex | 1230d9c1fff5 |
20001021100021 has 8 divisors (see below), whose sum is σ = 21543232574304. Its totient is φ = 18459334110000.
The previous prime is 20001021100019. The next prime is 20001021100061. The reversal of 20001021100021 is 12000112010002.
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 20001021100021 - 21 = 20001021100019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20001021099980 and 20001021100007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001021100061) 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, 131041855 + ... + 131194396.
It is an arithmetic number, because the mean of its divisors is an integer number (2692904071788).
Almost surely, 220001021100021 is an apocalyptic number.
It is an amenable number.
20001021100021 is a deficient number, since it is larger than the sum of its proper divisors (1542211474283).
20001021100021 is a wasteful number, since it uses less digits than its factorization.
20001021100021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 262242131.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20001021100021 its reverse (12000112010002), we get a palindrome (32001133110023).
The spelling of 20001021100021 in words is "twenty trillion, one billion, twenty-one million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •