Base | Representation |
---|---|
bin | 1010001011111100000100… |
… | …1001100010000010110111 |
3 | 1110122201201121100211011202 |
4 | 2202333001021202002313 |
5 | 2432001022340221403 |
6 | 35453150554123115 |
7 | 2234121620152514 |
oct | 242770111420267 |
9 | 43581647324152 |
10 | 11200220242103 |
11 | 3628a94379282 |
12 | 130a81712049b |
13 | 63323a266ba9 |
14 | 2aa1449c830b |
15 | 146524135688 |
hex | a2fc12620b7 |
11200220242103 has 8 divisors (see below), whose sum is σ = 11591119981200. Its totient is φ = 10809632852928.
The previous prime is 11200220242087. The next prime is 11200220242163. The reversal of 11200220242103 is 30124202200211.
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 11200220242103 - 24 = 11200220242087 is a prime.
It is a super-2 number, since 2×112002202421032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200220242163) 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, 78014513 + ... + 78157946.
It is an arithmetic number, because the mean of its divisors is an integer number (1448889997650).
Almost surely, 211200220242103 is an apocalyptic number.
11200220242103 is a deficient number, since it is larger than the sum of its proper divisors (390899739097).
11200220242103 is a wasteful number, since it uses less digits than its factorization.
11200220242103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156174961.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 11200220242103 its reverse (30124202200211), we get a palindrome (41324422442314).
The spelling of 11200220242103 in words is "eleven trillion, two hundred billion, two hundred twenty million, two hundred forty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •