Base | Representation |
---|---|
bin | 11101011001010010000… |
… | …010110100111100111101 |
3 | 21011010000001021011022111 |
4 | 131121102002310330331 |
5 | 231043440320231023 |
6 | 4143551424214021 |
7 | 265640521031242 |
oct | 35312202647475 |
9 | 7133001234274 |
10 | 2020011102013 |
11 | 709755672a23 |
12 | 2875a976a311 |
13 | 118642328338 |
14 | 6daaa4255c9 |
15 | 37829bdd00d |
hex | 1d6520b4f3d |
2020011102013 has 16 divisors (see below), whose sum is σ = 2076590087280. Its totient is φ = 1963537514496.
The previous prime is 2020011101987. The next prime is 2020011102061. The reversal of 2020011102013 is 3102011100202.
It can be written as a sum of positive squares in 8 ways, for example, as 197151984324 + 1822859117689 = 444018^2 + 1350133^2 .
It is a cyclic number.
It is not a de Polignac number, because 2020011102013 - 221 = 2020009004861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020011101984 and 2020011102002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020011100013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268293633 + ... + 268301161.
It is an arithmetic number, because the mean of its divisors is an integer number (129786880455).
Almost surely, 22020011102013 is an apocalyptic number.
It is an amenable number.
2020011102013 is a deficient number, since it is larger than the sum of its proper divisors (56578985267).
2020011102013 is a wasteful number, since it uses less digits than its factorization.
2020011102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13536.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2020011102013 its reverse (3102011100202), we get a palindrome (5122022202215).
The spelling of 2020011102013 in words is "two trillion, twenty billion, eleven million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •