Base | Representation |
---|---|
bin | 110011001110111010… |
… | …1011110000110001110 |
3 | 101111222122012222112100 |
4 | 1212131311132012032 |
5 | 3300311142102342 |
6 | 122313222015530 |
7 | 10643311313163 |
oct | 1463565360616 |
9 | 344878188470 |
10 | 110022222222 |
11 | 42729748a90 |
12 | 193a62775a6 |
13 | a4b4caa953 |
14 | 547a12a06a |
15 | 2cde036e4c |
hex | 199dd5e18e |
110022222222 has 48 divisors (see below), whose sum is σ = 260112211632. Its totient is φ = 33332415360.
The previous prime is 110022222209. The next prime is 110022222227. The reversal of 110022222222 is 222222220011.
It is a Harshad number since it is a multiple of its sum of digits (18).
110022222222 is a modest number, since divided by 222222 gives 110022 as remainder.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 110022222195 and 110022222204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110022222227) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 832858 + ... + 955874.
It is an arithmetic number, because the mean of its divisors is an integer number (5419004409).
Almost surely, 2110022222222 is an apocalyptic number.
110022222222 is an abundant number, since it is smaller than the sum of its proper divisors (150089989410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110022222222 is a wasteful number, since it uses less digits than its factorization.
110022222222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127553 (or 127550 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 110022222222 its reverse (222222220011), we get a palindrome (332244442233).
The spelling of 110022222222 in words is "one hundred ten billion, twenty-two million, two hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •