Base | Representation |
---|---|
bin | 100000001010010100110… |
… | …101110000011011101000 |
3 | 21211021200101110111121212 |
4 | 200022110311300123220 |
5 | 242202301214410440 |
6 | 4411151034052252 |
7 | 315450410446616 |
oct | 40122465603350 |
9 | 7737611414555 |
10 | 2210110310120 |
11 | 78233671a689 |
12 | 2b840157a088 |
13 | 13054938426b |
14 | 78d8160a6b6 |
15 | 3c753d4e465 |
hex | 20294d706e8 |
2210110310120 has 64 divisors (see below), whose sum is σ = 5006696797440. Its totient is φ = 878011200000.
The previous prime is 2210110310119. The next prime is 2210110310137. The reversal of 2210110310120 is 210130110122.
It is a junction number, because it is equal to n+sod(n) for n = 2210110310095 and 2210110310104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31995620 + ... + 32064620.
It is an arithmetic number, because the mean of its divisors is an integer number (78229637460).
Almost surely, 22210110310120 is an apocalyptic number.
2210110310120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2210110310120 is an abundant number, since it is smaller than the sum of its proper divisors (2796586487320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2210110310120 is a wasteful number, since it uses less digits than its factorization.
2210110310120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74466 (or 74462 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 2210110310120 its reverse (210130110122), we get a palindrome (2420240420242).
The spelling of 2210110310120 in words is "two trillion, two hundred ten billion, one hundred ten million, three hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •