Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …001110101110100110101 |
3 | 21002012220202212000200202 |
4 | 131012312121311310311 |
5 | 230232422311120041 |
6 | 4130515520450245 |
7 | 264340213433606 |
oct | 35066631656465 |
9 | 7065822760622 |
10 | 2000220020021 |
11 | 70131a068113 |
12 | 2837a5779985 |
13 | 11680a00ac32 |
14 | 6cb4dba3dad |
15 | 3706c48da9b |
hex | 1d1b6675d35 |
2000220020021 has 4 divisors (see below), whose sum is σ = 2087186107872. Its totient is φ = 1913253932172.
The previous prime is 2000220020011. The next prime is 2000220020047. The reversal of 2000220020021 is 1200200220002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2000220020021 - 214 = 2000220003637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000220019984 and 2000220020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000220020011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43483043891 + ... + 43483043936.
It is an arithmetic number, because the mean of its divisors is an integer number (521796526968).
Almost surely, 22000220020021 is an apocalyptic number.
It is an amenable number.
2000220020021 is a deficient number, since it is larger than the sum of its proper divisors (86966087851).
2000220020021 is an equidigital number, since it uses as much as digits as its factorization.
2000220020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86966087850.
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 2000220020021 its reverse (1200200220002), we get a palindrome (3200420240023).
The spelling of 2000220020021 in words is "two trillion, two hundred twenty million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •