Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …100101101100001010101 |
3 | 21011002222100110111222200 |
4 | 131121101130231201111 |
5 | 231043430241010401 |
6 | 4143550430115113 |
7 | 265640340064302 |
oct | 35312134554125 |
9 | 7132870414880 |
10 | 2020001110101 |
11 | 70974aa68947 |
12 | 2875a634ba99 |
13 | 11864023a370 |
14 | 6daa8d840a9 |
15 | 37828db7686 |
hex | 1d65172d855 |
2020001110101 has 12 divisors (see below), whose sum is σ = 3142223949228. Its totient is φ = 1243077606144.
The previous prime is 2020001110069. The next prime is 2020001110199. The reversal of 2020001110101 is 1010111000202.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1107261630225 + 912739479876 = 1052265^2 + 955374^2 .
It is not a de Polignac number, because 2020001110101 - 25 = 2020001110069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020001110901) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8632483260 + ... + 8632483493.
It is an arithmetic number, because the mean of its divisors is an integer number (261851995769).
Almost surely, 22020001110101 is an apocalyptic number.
It is an amenable number.
2020001110101 is a deficient number, since it is larger than the sum of its proper divisors (1122222839127).
2020001110101 is a wasteful number, since it uses less digits than its factorization.
2020001110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17264966772 (or 17264966769 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2020001110101 its reverse (1010111000202), we get a palindrome (3030112110303).
The spelling of 2020001110101 in words is "two trillion, twenty billion, one million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •