Base | Representation |
---|---|
bin | 11110110110011001111… |
… | …110001101111100011100 |
3 | 21111200002120222012112002 |
4 | 132312121332031330130 |
5 | 234213231014213040 |
6 | 4301525430301432 |
7 | 306110425350626 |
oct | 36663176157434 |
9 | 7450076865462 |
10 | 2120002101020 |
11 | 7480a6a10491 |
12 | 2a2a544b7878 |
13 | 124bb9005b3b |
14 | 748741c1c16 |
15 | 3a22d24aa15 |
hex | 1ed99f8df1c |
2120002101020 has 96 divisors (see below), whose sum is σ = 4511289758976. Its totient is φ = 836783897600.
The previous prime is 2120002101013. The next prime is 2120002101023. The reversal of 2120002101020 is 201012000212.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2120002100992 and 2120002101010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120002101023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 518209175 + ... + 518213265.
It is an arithmetic number, because the mean of its divisors is an integer number (46992601656).
Almost surely, 22120002101020 is an apocalyptic number.
2120002101020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2120002101020 is an abundant number, since it is smaller than the sum of its proper divisors (2391287657956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2120002101020 is a wasteful number, since it uses less digits than its factorization.
2120002101020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5171 (or 5169 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2120002101020 its reverse (201012000212), we get a palindrome (2321014101232).
The spelling of 2120002101020 in words is "two trillion, one hundred twenty billion, two million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •