Base | Representation |
---|---|
bin | 1010001011111011101010… |
… | …0100111111110000110001 |
3 | 1110122201102220221000002101 |
4 | 2202332322210333300301 |
5 | 2432000311130014301 |
6 | 35453132015220401 |
7 | 2234116111135462 |
oct | 242767244776061 |
9 | 43581386830071 |
10 | 11200110001201 |
11 | 3628a381226a0 |
12 | 130a7a6217701 |
13 | 633220478ca4 |
14 | 2aa1340ccd69 |
15 | 14651960b701 |
hex | a2fba93fc31 |
11200110001201 has 8 divisors (see below), whose sum is σ = 12372963868800. Its totient is φ = 10053033141840.
The previous prime is 11200110001181. The next prime is 11200110001219. The reversal of 11200110001201 is 10210001100211.
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 11200110001201 - 215 = 11200109968433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11200110001901) 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, 6444251146 + ... + 6444252883.
It is an arithmetic number, because the mean of its divisors is an integer number (1546620483600).
Almost surely, 211200110001201 is an apocalyptic number.
11200110001201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11200110001201 is a deficient number, since it is larger than the sum of its proper divisors (1172853867599).
11200110001201 is a wasteful number, since it uses less digits than its factorization.
11200110001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12888504119.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11200110001201 its reverse (10210001100211), we get a palindrome (21410111101412).
The spelling of 11200110001201 in words is "eleven trillion, two hundred billion, one hundred ten million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •