Base | Representation |
---|---|
bin | 10000010100000111011… |
… | …011100010000010111111 |
3 | 10222011210011100212222021 |
4 | 100110013123202002333 |
5 | 121332013421401421 |
6 | 2215010434101011 |
7 | 143666115206341 |
oct | 20240733420277 |
9 | 3864704325867 |
10 | 1121111122111 |
11 | 3a2508001552 |
12 | 161341a1a767 |
13 | 819497290c6 |
14 | 3c395185291 |
15 | 1e26904d341 |
hex | 105076e20bf |
1121111122111 has 16 divisors (see below), whose sum is σ = 1163777408640. Its totient is φ = 1079262122400.
The previous prime is 1121111122097. The next prime is 1121111122189. The reversal of 1121111122111 is 1112211111211.
It is a cyclic number.
It is not a de Polignac number, because 1121111122111 - 225 = 1121077567679 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121111122211) 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 15 ways as a sum of consecutive naturals, for example, 1120561 + ... + 1870261.
It is an arithmetic number, because the mean of its divisors is an integer number (72736088040).
Almost surely, 21121111122111 is an apocalyptic number.
1121111122111 is a deficient number, since it is larger than the sum of its proper divisors (42666286529).
1121111122111 is an equidigital number, since it uses as much as digits as its factorization.
1121111122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750246.
The product of its digits is 8, while the sum is 16.
Adding to 1121111122111 its reverse (1112211111211), we get a palindrome (2233322233322).
It can be divided in two parts, 11211 and 11122111, that multiplied together give a palindrome (124689986421).
The spelling of 1121111122111 in words is "one trillion, one hundred twenty-one billion, one hundred eleven million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •