Base | Representation |
---|---|
bin | 11001000000110111111011… |
… | …110100001001000001101000 |
3 | 112102111222012012220122011221 |
4 | 121000313323310021001220 |
5 | 103404410440324231440 |
6 | 1025550242512231424 |
7 | 32113022432022463 |
oct | 3100677364110150 |
9 | 472458165818157 |
10 | 110011222102120 |
11 | 32064551987659 |
12 | 10408ab383b574 |
13 | 4950024221281 |
14 | 1d248005082da |
15 | cab99ea24d4a |
hex | 640dfbd09068 |
110011222102120 has 32 divisors (see below), whose sum is σ = 247526154006120. Its totient is φ = 44004328080640.
The previous prime is 110011222102109. The next prime is 110011222102163. The reversal of 110011222102120 is 21201222110011.
It can be written as a sum of positive squares in 4 ways, for example, as 24888344947684 + 85122877154436 = 4988822^2 + 9226206^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110011222102094 and 110011222102103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6381894 + ... + 16147786.
Almost surely, 2110011222102120 is an apocalyptic number.
110011222102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110011222102120 is an abundant number, since it is smaller than the sum of its proper divisors (137514931904000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110011222102120 is a wasteful number, since it uses less digits than its factorization.
110011222102120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10047525 (or 10047521 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110011222102120 its reverse (21201222110011), we get a palindrome (131212444212131).
The spelling of 110011222102120 in words is "one hundred ten trillion, eleven billion, two hundred twenty-two million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •