Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …110000001100111100010 |
3 | 10221020020012202201200222 |
4 | 100022321112001213202 |
5 | 121201230021333442 |
6 | 2210252222443042 |
7 | 143165563453604 |
oct | 20127126014742 |
9 | 3836205681628 |
10 | 1111211121122 |
11 | 399297788253 |
12 | 15b43a433482 |
13 | 80a2c681b5b |
14 | 3bad6413174 |
15 | 1dd89d448d2 |
hex | 102b95819e2 |
1111211121122 has 16 divisors (see below), whose sum is σ = 1774615365432. Its totient is φ = 520033800960.
The previous prime is 1111211121121. The next prime is 1111211121221. The reversal of 1111211121122 is 2211211121111.
It can be written as a sum of positive squares in 4 ways, for example, as 491809066681 + 619402054441 = 701291^2 + 787021^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1111211121122.
It is not an unprimeable number, because it can be changed into a prime (1111211121121) 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 7 ways as a sum of consecutive naturals, for example, 90277493 + ... + 90289800.
Almost surely, 21111211121122 is an apocalyptic number.
1111211121122 is a deficient number, since it is larger than the sum of its proper divisors (663404244310).
1111211121122 is a wasteful number, since it uses less digits than its factorization.
1111211121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180567493.
The product of its digits is 16, while the sum is 17.
Adding to 1111211121122 its reverse (2211211121111), we get a palindrome (3322422242233).
The spelling of 1111211121122 in words is "one trillion, one hundred eleven billion, two hundred eleven million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •