Base | Representation |
---|---|
bin | 1101001111010… |
… | …01010010010110 |
3 | 21201222020020000 |
4 | 12213221102112 |
5 | 211412243042 |
6 | 15004152130 |
7 | 2515650330 |
oct | 647512226 |
9 | 251866200 |
10 | 111056022 |
11 | 57763040 |
12 | 31238646 |
13 | 1a014c2c |
14 | 10a6c450 |
15 | 9b3a74c |
hex | 69e9496 |
111056022 has 160 divisors (see below), whose sum is σ = 321995520. Its totient is φ = 27760320.
The previous prime is 111055963. The next prime is 111056047. The reversal of 111056022 is 220650111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 111055986 and 111056004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 361593 + ... + 361899.
It is an arithmetic number, because the mean of its divisors is an integer number (2012472).
Almost surely, 2111056022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111056022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160997760).
111056022 is an abundant number, since it is smaller than the sum of its proper divisors (210939498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111056022 is a wasteful number, since it uses less digits than its factorization.
111056022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368 (or 359 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 111056022 is about 10538.3121039377. The cubic root of 111056022 is about 480.6703913878.
The spelling of 111056022 in words is "one hundred eleven million, fifty-six thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •