Base | Representation |
---|---|
bin | 1010000110001111000000… |
… | …0000010101010100000001 |
3 | 1110022100202221121000011121 |
4 | 2201203300000111110001 |
5 | 2423344322330041001 |
6 | 35340142422112241 |
7 | 2224052261614426 |
oct | 241436000252401 |
9 | 43270687530147 |
10 | 11102222112001 |
11 | 35a0475a47709 |
12 | 12b382787b681 |
13 | 626c20407967 |
14 | 2a54c978bd4d |
15 | 143bdaa2c6a1 |
hex | a18f0015501 |
11102222112001 has 8 divisors (see below), whose sum is σ = 11958329815520. Its totient is φ = 10273292430912.
The previous prime is 11102222111977. The next prime is 11102222112017. The reversal of 11102222112001 is 10021122220111.
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 11102222112001 - 221 = 11102220014849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11102222113001) 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, 6794504760 + ... + 6794506393.
It is an arithmetic number, because the mean of its divisors is an integer number (1494791226940).
Almost surely, 211102222112001 is an apocalyptic number.
It is an amenable number.
11102222112001 is a deficient number, since it is larger than the sum of its proper divisors (856107703519).
11102222112001 is a wasteful number, since it uses less digits than its factorization.
11102222112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13589011215.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11102222112001 its reverse (10021122220111), we get a palindrome (21123344332112).
It can be divided in two parts, 1110222 and 2112001, that added together give a palindrome (3222223).
The spelling of 11102222112001 in words is "eleven trillion, one hundred two billion, two hundred twenty-two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •