Base | Representation |
---|---|
bin | 1010000110001011010001… |
… | …0001101000000010101001 |
3 | 1110022021012002222001200012 |
4 | 2201202310101220002221 |
5 | 2423340244310342301 |
6 | 35335455143421305 |
7 | 2224015403116604 |
oct | 241426421500251 |
9 | 43267162861605 |
10 | 11101220012201 |
11 | 35a000131a260 |
12 | 12b35a8154835 |
13 | 626ac0913ab7 |
14 | 2a543265533b |
15 | 143b7ca83ebb |
hex | a18b44680a9 |
11101220012201 has 8 divisors (see below), whose sum is σ = 12112135089600. Its totient is φ = 10090590477840.
The previous prime is 11101220012173. The next prime is 11101220012209. The reversal of 11101220012201 is 10221002210111.
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 11101220012201 - 210 = 11101220011177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11101220012209) 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, 71304461 + ... + 71459978.
It is an arithmetic number, because the mean of its divisors is an integer number (1514016886200).
Almost surely, 211101220012201 is an apocalyptic number.
11101220012201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11101220012201 is a deficient number, since it is larger than the sum of its proper divisors (1010915077399).
11101220012201 is a wasteful number, since it uses less digits than its factorization.
11101220012201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142771519.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11101220012201 its reverse (10221002210111), we get a palindrome (21322222222312).
The spelling of 11101220012201 in words is "eleven trillion, one hundred one billion, two hundred twenty million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •