Base | Representation |
---|---|
bin | 1010001011111100000000… |
… | …0000100011101010001001 |
3 | 1110122201200021100220212212 |
4 | 2202333000000203222021 |
5 | 2432001002441042301 |
6 | 35453145032114505 |
7 | 2234121265436303 |
oct | 242770000435211 |
9 | 43581607326785 |
10 | 11200201112201 |
11 | 3628a845a2742 |
12 | 130a810835a35 |
13 | 6332362c981a |
14 | 2aa142248973 |
15 | 1465226074bb |
hex | a2fc0023a89 |
11200201112201 has 8 divisors (see below), whose sum is σ = 11830369968384. Its totient is φ = 10586836758960.
The previous prime is 11200201112173. The next prime is 11200201112267. The reversal of 11200201112201 is 10221110200211.
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 11200201112201 - 214 = 11200201095817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11200201112701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4201124366 + ... + 4201127031.
It is an arithmetic number, because the mean of its divisors is an integer number (1478796246048).
Almost surely, 211200201112201 is an apocalyptic number.
It is an amenable number.
11200201112201 is a deficient number, since it is larger than the sum of its proper divisors (630168856183).
11200201112201 is an equidigital number, since it uses as much as digits as its factorization.
11200201112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8402251471.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11200201112201 its reverse (10221110200211), we get a palindrome (21421311312412).
The spelling of 11200201112201 in words is "eleven trillion, two hundred billion, two hundred one million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •