Base | Representation |
---|---|
bin | 111110111100010… |
… | …1011101100001100 |
3 | 12110012010021110101 |
4 | 1331320223230030 |
5 | 13311133323040 |
6 | 545323420444 |
7 | 103223540350 |
oct | 17570535414 |
9 | 5405107411 |
10 | 2112011020 |
11 | 9941a2159 |
12 | 4ab384724 |
13 | 278734b82 |
14 | 1606d5460 |
15 | c563b09a |
hex | 7de2bb0c |
2112011020 has 24 divisors (see below), whose sum is σ = 5068826784. Its totient is φ = 724118016.
The previous prime is 2112011017. The next prime is 2112011021. The reversal of 2112011020 is 201102112.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 2112010988 and 2112011006.
It is not an unprimeable number, because it can be changed into a prime (2112011021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7542757 + ... + 7543036.
It is an arithmetic number, because the mean of its divisors is an integer number (211201116).
Almost surely, 22112011020 is an apocalyptic number.
2112011020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2112011020 is an abundant number, since it is smaller than the sum of its proper divisors (2956815764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112011020 is a wasteful number, since it uses less digits than its factorization.
2112011020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15085809 (or 15085807 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2112011020 is about 45956.6210681334. The cubic root of 2112011020 is about 1283.0159634988.
Adding to 2112011020 its reverse (201102112), we get a palindrome (2313113132).
The spelling of 2112011020 in words is "two billion, one hundred twelve million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •