Base | Representation |
---|---|
bin | 1010000111010100111101… |
… | …1000110000100111100001 |
3 | 1110101011020202200100012011 |
4 | 2201311033120300213201 |
5 | 2424201303032020001 |
6 | 35352530133032521 |
7 | 2225315542114042 |
oct | 241651730604741 |
9 | 43334222610164 |
10 | 11121002220001 |
11 | 35a8432913823 |
12 | 12b73a9185741 |
13 | 628924144bbb |
14 | 2a638ba468c9 |
15 | 14443962dd51 |
hex | a1d4f6309e1 |
11121002220001 has 8 divisors (see below), whose sum is σ = 11123330543208. Its totient is φ = 11118674160000.
The previous prime is 11121002219993. The next prime is 11121002220037. The reversal of 11121002220001 is 10002220012111.
It can be written as a sum of positive squares in 4 ways, for example, as 3873815176401 + 7247187043600 = 1968201^2 + 2692060^2 .
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 11121002220001 - 23 = 11121002219993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121002220091) 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, 99558141 + ... + 99669781.
It is an arithmetic number, because the mean of its divisors is an integer number (1390416317901).
Almost surely, 211121002220001 is an apocalyptic number.
It is an amenable number.
11121002220001 is a deficient number, since it is larger than the sum of its proper divisors (2328323207).
11121002220001 is a wasteful number, since it uses less digits than its factorization.
11121002220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131603.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11121002220001 its reverse (10002220012111), we get a palindrome (21123222232112).
The spelling of 11121002220001 in words is "eleven trillion, one hundred twenty-one billion, two million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •