Base | Representation |
---|---|
bin | 110011010100110011… |
… | …1111110001010001000 |
3 | 101112111102101122112001 |
4 | 1212221213332022020 |
5 | 3301212310310440 |
6 | 122345005200344 |
7 | 10651232425243 |
oct | 1465147761210 |
9 | 345442348461 |
10 | 110220010120 |
11 | 4282035aa60 |
12 | 194405600b4 |
13 | a516c6c0cc |
14 | 54984d425a |
15 | 2d015a5b9a |
hex | 19a99fe288 |
110220010120 has 64 divisors (see below), whose sum is σ = 273579897600. Its totient is φ = 39629652480.
The previous prime is 110220010093. The next prime is 110220010151. The reversal of 110220010120 is 21010022011.
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 = 110220010097 and 110220010106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1368144 + ... + 1446463.
It is an arithmetic number, because the mean of its divisors is an integer number (4274685900).
Almost surely, 2110220010120 is an apocalyptic number.
110220010120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110220010120 is an abundant number, since it is smaller than the sum of its proper divisors (163359887480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110220010120 is a wasteful number, since it uses less digits than its factorization.
110220010120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2814718 (or 2814714 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110220010120 its reverse (21010022011), we get a palindrome (131230032131).
The spelling of 110220010120 in words is "one hundred ten billion, two hundred twenty million, ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •