Base | Representation |
---|---|
bin | 100001011010010… |
… | …1111011100111111 |
3 | 2220010120220102011 |
4 | 1002310233130333 |
5 | 4244001401421 |
6 | 303125312051 |
7 | 36532244404 |
oct | 10264573477 |
9 | 2803526364 |
10 | 1121122111 |
11 | 5259316aa |
12 | 273565627 |
13 | 14b367a85 |
14 | a8c7a2ab |
15 | 686594e1 |
hex | 42d2f73f |
1121122111 has 8 divisors (see below), whose sum is σ = 1140328800. Its totient is φ = 1101942240.
The previous prime is 1121122073. The next prime is 1121122117. The reversal of 1121122111 is 1112211211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1121122111 - 27 = 1121121983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121122091 and 1121122100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121122117) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 89205 + ... + 100993.
It is an arithmetic number, because the mean of its divisors is an integer number (142541100).
Almost surely, 21121122111 is an apocalyptic number.
1121122111 is a deficient number, since it is larger than the sum of its proper divisors (19206689).
1121122111 is a wasteful number, since it uses less digits than its factorization.
1121122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13409.
The product of its digits is 8, while the sum is 13.
The square root of 1121122111 is about 33483.1616040063. The cubic root of 1121122111 is about 1038.8455233456.
Adding to 1121122111 its reverse (1112211211), we get a palindrome (2233333322).
The spelling of 1121122111 in words is "one billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •