Base | Representation |
---|---|
bin | 11101011001011101111… |
… | …001100100000010001011 |
3 | 21011010111220112020002000 |
4 | 131121131321210002023 |
5 | 231044342230000021 |
6 | 4144023251242043 |
7 | 265645454445630 |
oct | 35313571440213 |
9 | 7133456466060 |
10 | 2020210000011 |
11 | 709847972a35 |
12 | 2876442a9323 |
13 | 1186745b7b68 |
14 | 6dac89dc187 |
15 | 3783c3cab26 |
hex | 1d65de6408b |
2020210000011 has 64 divisors (see below), whose sum is σ = 3429979914240. Its totient is φ = 1151195772960.
The previous prime is 2020210000007. The next prime is 2020210000031. The reversal of 2020210000011 is 1100000120202.
It is not a de Polignac number, because 2020210000011 - 22 = 2020210000007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2020209999948 and 2020210000002.
It is not an unprimeable number, because it can be changed into a prime (2020210000031) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 236471206 + ... + 236479748.
It is an arithmetic number, because the mean of its divisors is an integer number (53593436160).
Almost surely, 22020210000011 is an apocalyptic number.
2020210000011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2020210000011 is a deficient number, since it is larger than the sum of its proper divisors (1409769914229).
2020210000011 is a wasteful number, since it uses less digits than its factorization.
2020210000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11893 (or 11887 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2020210000011 its reverse (1100000120202), we get a palindrome (3120210120213).
The spelling of 2020210000011 in words is "two trillion, twenty billion, two hundred ten million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •