Base | Representation |
---|---|
bin | 11101011001010001111… |
… | …111000000100101110111 |
3 | 21011002222222101022100001 |
4 | 131121101333000211313 |
5 | 231043440041213421 |
6 | 4143551350532131 |
7 | 265640506362202 |
oct | 35312177004567 |
9 | 7132888338301 |
10 | 2020010101111 |
11 | 709755049a32 |
12 | 2875a9367047 |
13 | 1186420678a2 |
14 | 6daaa244939 |
15 | 37829a91691 |
hex | 1d651fc0977 |
2020010101111 has 8 divisors (see below), whose sum is σ = 2046972723264. Its totient is φ = 1993183999200.
The previous prime is 2020010101103. The next prime is 2020010101127. The reversal of 2020010101111 is 1111010100202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2020010101111 - 23 = 2020010101103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020010101511) 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, 34100271 + ... + 34159456.
It is an arithmetic number, because the mean of its divisors is an integer number (255871590408).
Almost surely, 22020010101111 is an apocalyptic number.
2020010101111 is a deficient number, since it is larger than the sum of its proper divisors (26962622153).
2020010101111 is a wasteful number, since it uses less digits than its factorization.
2020010101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68260121.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2020010101111 its reverse (1111010100202), we get a palindrome (3131020201313).
Subtracting from 2020010101111 its reverse (1111010100202), we obtain a palindrome (909000000909).
The spelling of 2020010101111 in words is "two trillion, twenty billion, ten million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •