Base | Representation |
---|---|
bin | 1010000110110000011100… |
… | …1001000001110111011001 |
3 | 1110100012221122110020120212 |
4 | 2201230013021001313121 |
5 | 2424021214222432301 |
6 | 35344225341500505 |
7 | 2224520620253501 |
oct | 241540711016731 |
9 | 43305848406525 |
10 | 11111200202201 |
11 | 35a4262933770 |
12 | 12b5512571735 |
13 | 627a21486478 |
14 | 2a5adbcdca01 |
15 | 144063d2c4bb |
hex | a1b07241dd9 |
11111200202201 has 8 divisors (see below), whose sum is σ = 12188277873408. Its totient is φ = 10045283958000.
The previous prime is 11111200202191. The next prime is 11111200202203. The reversal of 11111200202201 is 10220200211111.
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 11111200202201 - 222 = 11111196007897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11111200202203) 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, 2790354665 + ... + 2790358646.
It is an arithmetic number, because the mean of its divisors is an integer number (1523534734176).
Almost surely, 211111200202201 is an apocalyptic number.
11111200202201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11111200202201 is a deficient number, since it is larger than the sum of its proper divisors (1077077671207).
11111200202201 is a wasteful number, since it uses less digits than its factorization.
11111200202201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5580713503.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11111200202201 its reverse (10220200211111), we get a palindrome (21331400413312).
The spelling of 11111200202201 in words is "eleven trillion, one hundred eleven billion, two hundred million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •