Base | Representation |
---|---|
bin | 1101001111011… |
… | …00111110100110 |
3 | 21201222222222000 |
4 | 12213230332212 |
5 | 211413234032 |
6 | 15004350130 |
7 | 2516042400 |
oct | 647547646 |
9 | 251888860 |
10 | 111071142 |
11 | 57773436 |
12 | 31245346 |
13 | 1a01ba90 |
14 | 10a73b70 |
15 | 9b3ee7c |
hex | 69ecfa6 |
111071142 has 96 divisors (see below), whose sum is σ = 309304800. Its totient is φ = 29284416.
The previous prime is 111071141. The next prime is 111071153. The reversal of 111071142 is 241170111.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111071141) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 32784 + ... + 36012.
It is an arithmetic number, because the mean of its divisors is an integer number (3221925).
Almost surely, 2111071142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111071142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154652400).
111071142 is an abundant number, since it is smaller than the sum of its proper divisors (198233658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111071142 is a wasteful number, since it uses less digits than its factorization.
111071142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3267 (or 3254 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 18.
The square root of 111071142 is about 10539.0294619571. The cubic root of 111071142 is about 480.6922044223.
The spelling of 111071142 in words is "one hundred eleven million, seventy-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •