Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …000110111001011111001 |
3 | 21011002222021120020220202 |
4 | 131121101120313023321 |
5 | 231043430011213423 |
6 | 4143550352331545 |
7 | 265640325362531 |
oct | 35312130671371 |
9 | 7132867506822 |
10 | 2020000101113 |
11 | 70974a439875 |
12 | 2875a5b43bb5 |
13 | 11863cc76027 |
14 | 6daa8ba04c1 |
15 | 37828c68728 |
hex | 1d6516372f9 |
2020000101113 has 8 divisors (see below), whose sum is σ = 2020542644640. Its totient is φ = 2019457641600.
The previous prime is 2020000101047. The next prime is 2020000101121. The reversal of 2020000101113 is 3111010000202.
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 2020000101113 - 28 = 2020000100857 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020000101094 and 2020000101103.
It is not an unprimeable number, because it can be changed into a prime (2020000101193) 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, 103638473 + ... + 103657961.
It is an arithmetic number, because the mean of its divisors is an integer number (252567830580).
Almost surely, 22020000101113 is an apocalyptic number.
It is an amenable number.
2020000101113 is a deficient number, since it is larger than the sum of its proper divisors (542543527).
2020000101113 is a wasteful number, since it uses less digits than its factorization.
2020000101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42007.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2020000101113 its reverse (3111010000202), we get a palindrome (5131010101315).
The spelling of 2020000101113 in words is "two trillion, twenty billion, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •