Base | Representation |
---|---|
bin | 10100101100101010… |
… | …11000011100011110 |
3 | 1001200102102021220100 |
4 | 22112111120130132 |
5 | 140224200402032 |
6 | 5034351201530 |
7 | 542240323362 |
oct | 122625303436 |
9 | 31612367810 |
10 | 11112122142 |
11 | 4792559920 |
12 | 21a15162a6 |
13 | 1081223904 |
14 | 775b392a2 |
15 | 45083a97c |
hex | 29655871e |
11112122142 has 24 divisors (see below), whose sum is σ = 26265016440. Its totient is φ = 3367309680.
The previous prime is 11112122137. The next prime is 11112122159. The reversal of 11112122142 is 24122121111.
11112122142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×111121221423 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 28060717 + ... + 28061112.
It is an arithmetic number, because the mean of its divisors is an integer number (1094375685).
Almost surely, 211112122142 is an apocalyptic number.
11112122142 is an abundant number, since it is smaller than the sum of its proper divisors (15152894298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112122142 is a wasteful number, since it uses less digits than its factorization.
11112122142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56121848 (or 56121845 counting only the distinct ones).
The product of its digits is 64, while the sum is 18.
Adding to 11112122142 its reverse (24122121111), we get a palindrome (35234243253).
The spelling of 11112122142 in words is "eleven billion, one hundred twelve million, one hundred twenty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •