Base | Representation |
---|---|
bin | 11101011001011101011… |
… | …011110110001011010001 |
3 | 21011010111100212110012010 |
4 | 131121131123312023101 |
5 | 231044333231210001 |
6 | 4144022412253133 |
7 | 265645331312343 |
oct | 35313533661321 |
9 | 7133440773163 |
10 | 2020202210001 |
11 | 709843532208 |
12 | 2876417711a9 |
13 | 118672abb1a1 |
14 | 6dac7971293 |
15 | 3783b88c8d6 |
hex | 1d65d6f62d1 |
2020202210001 has 4 divisors (see below), whose sum is σ = 2693602946672. Its totient is φ = 1346801473332.
The previous prime is 2020202209999. The next prime is 2020202210003. The reversal of 2020202210001 is 1000122020202.
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 an interprime number because it is at equal distance from previous prime (2020202209999) and next prime (2020202210003).
It is not a de Polignac number, because 2020202210001 - 21 = 2020202209999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2020202210003) 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, 336700368331 + ... + 336700368336.
It is an arithmetic number, because the mean of its divisors is an integer number (673400736668).
Almost surely, 22020202210001 is an apocalyptic number.
It is an amenable number.
2020202210001 is a deficient number, since it is larger than the sum of its proper divisors (673400736671).
2020202210001 is an equidigital number, since it uses as much as digits as its factorization.
2020202210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 673400736670.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2020202210001 its reverse (1000122020202), we get a palindrome (3020324230203).
The spelling of 2020202210001 in words is "two trillion, twenty billion, two hundred two million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •