Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …001010100011110110111 |
3 | 21011002222021210100112010 |
4 | 131121101121110132313 |
5 | 231043430024033421 |
6 | 4143550355055303 |
7 | 265640326402425 |
oct | 35312131243667 |
9 | 7132867710463 |
10 | 2020000221111 |
11 | 70974a510a44 |
12 | 2875a5ba1533 |
13 | 11863ccb8832 |
14 | 6daa8bd2115 |
15 | 37828c8e076 |
hex | 1d6516547b7 |
2020000221111 has 8 divisors (see below), whose sum is σ = 2693340193264. Its totient is φ = 1346663531520.
The previous prime is 2020000221101. The next prime is 2020000221149. The reversal of 2020000221111 is 1111220000202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2020000221111 - 25 = 2020000221079 is a prime.
It is a super-4 number, since 4×20200002211114 (a number of 50 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020000221101) 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 7 ways as a sum of consecutive naturals, for example, 2014071 + ... + 2845431.
It is an arithmetic number, because the mean of its divisors is an integer number (336667524158).
Almost surely, 22020000221111 is an apocalyptic number.
2020000221111 is a deficient number, since it is larger than the sum of its proper divisors (673339972153).
2020000221111 is an equidigital number, since it uses as much as digits as its factorization.
2020000221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1641281.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2020000221111 its reverse (1111220000202), we get a palindrome (3131220221313).
The spelling of 2020000221111 in words is "two trillion, twenty billion, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.043 sec. • engine limits •