Base | Representation |
---|---|
bin | 10000010011000101110… |
… | …111101101000100001110 |
3 | 10222001221111200121121112 |
4 | 100103011313231010032 |
5 | 121322240332223042 |
6 | 2214305343132022 |
7 | 143626631133434 |
oct | 20230567550416 |
9 | 3861844617545 |
10 | 1120011211022 |
11 | 3a1aa3148020 |
12 | 1610955a4012 |
13 | 818028a9a42 |
14 | 3c2cd06ad54 |
15 | 1e2026d3982 |
hex | 104c5ded10e |
1120011211022 has 32 divisors (see below), whose sum is σ = 1847079936000. Its totient is φ = 505127965600.
The previous prime is 1120011211001. The next prime is 1120011211037. The reversal of 1120011211022 is 2201121100211.
It is a super-2 number, since 2×11200112110222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120011210988 and 1120011211006.
It is a congruent number.
It is an unprimeable number.
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, 1291979 + ... + 1977177.
It is an arithmetic number, because the mean of its divisors is an integer number (57721248000).
Almost surely, 21120011211022 is an apocalyptic number.
1120011211022 is a deficient number, since it is larger than the sum of its proper divisors (727068724978).
1120011211022 is a wasteful number, since it uses less digits than its factorization.
1120011211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685792.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1120011211022 its reverse (2201121100211), we get a palindrome (3321132311233).
The spelling of 1120011211022 in words is "one trillion, one hundred twenty billion, eleven million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •