Base | Representation |
---|---|
bin | 11101011001010001111… |
… | …111011000110010010011 |
3 | 21011002222222120100021102 |
4 | 131121101333120302103 |
5 | 231043440102401321 |
6 | 4143551353015015 |
7 | 265640510254133 |
oct | 35312177306223 |
9 | 7132888510242 |
10 | 2020010200211 |
11 | 709755107433 |
12 | 2875a93b446b |
13 | 1186420a0a23 |
14 | 6daaa26cac3 |
15 | 37829ab0c0b |
hex | 1d651fd8c93 |
2020010200211 has 4 divisors (see below), whose sum is σ = 2024808324624. Its totient is φ = 2015212075800.
The previous prime is 2020010200177. The next prime is 2020010200237. The reversal of 2020010200211 is 1120020100202.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2020010200211 - 230 = 2018936458387 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020010200192 and 2020010200201.
It is not an unprimeable number, because it can be changed into a prime (2020010200111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2399061575 + ... + 2399062416.
It is an arithmetic number, because the mean of its divisors is an integer number (506202081156).
Almost surely, 22020010200211 is an apocalyptic number.
2020010200211 is a deficient number, since it is larger than the sum of its proper divisors (4798124413).
2020010200211 is an equidigital number, since it uses as much as digits as its factorization.
2020010200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4798124412.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2020010200211 its reverse (1120020100202), we get a palindrome (3140030300413).
The spelling of 2020010200211 in words is "two trillion, twenty billion, ten million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •