Base | Representation |
---|---|
bin | 11101101100000110110… |
… | …11001110000101001011 |
3 | 10121112002101002001012202 |
4 | 32312003123032011023 |
5 | 113203142210400021 |
6 | 2100344424430415 |
7 | 133462221426452 |
oct | 16660333160513 |
9 | 3545071061182 |
10 | 1020112200011 |
11 | 3636998194a3 |
12 | 14585561840b |
13 | 75271c98cc8 |
14 | 375335b7b99 |
15 | 1b807296a0b |
hex | ed836ce14b |
1020112200011 has 8 divisors (see below), whose sum is σ = 1055695536480. Its totient is φ = 984556000512.
The previous prime is 1020112200001. The next prime is 1020112200059. The reversal of 1020112200011 is 1100022110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1020112200011 is a prime.
It is a super-2 number, since 2×10201122000112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020112199965 and 1020112200001.
It is not an unprimeable number, because it can be changed into a prime (1020112200001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6707735 + ... + 6858128.
It is an arithmetic number, because the mean of its divisors is an integer number (131961942060).
Almost surely, 21020112200011 is an apocalyptic number.
1020112200011 is a deficient number, since it is larger than the sum of its proper divisors (35583336469).
1020112200011 is a wasteful number, since it uses less digits than its factorization.
1020112200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13568485.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1020112200011 its reverse (1100022110201), we get a palindrome (2120134310212).
The spelling of 1020112200011 in words is "one trillion, twenty billion, one hundred twelve million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •