Base | Representation |
---|---|
bin | 1010000000111011111010… |
… | …1011010010110101000001 |
3 | 1102222122211110210210022200 |
4 | 2200032332223102311001 |
5 | 2420401414222400001 |
6 | 35230250414423413 |
7 | 2214350543255541 |
oct | 240167653226501 |
9 | 42878743723280 |
10 | 11011200200001 |
11 | 35659074a6a51 |
12 | 129a064801b69 |
13 | 61b475975a31 |
14 | 2a0d32c7b321 |
15 | 14165eae2086 |
hex | a03bead2d41 |
11011200200001 has 12 divisors (see below), whose sum is σ = 15992940256020. Its totient is φ = 7300243225440.
The previous prime is 11011200199969. The next prime is 11011200200041. The reversal of 11011200200001 is 10000200211011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1358844833025 + 9652355366976 = 1165695^2 + 3106824^2 .
It is not a de Polignac number, because 11011200200001 - 25 = 11011200199969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11011200200041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3379740606 + ... + 3379743863.
It is an arithmetic number, because the mean of its divisors is an integer number (1332745021335).
Almost surely, 211011200200001 is an apocalyptic number.
It is an amenable number.
11011200200001 is a deficient number, since it is larger than the sum of its proper divisors (4981740056019).
11011200200001 is a wasteful number, since it uses less digits than its factorization.
11011200200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6759484656 (or 6759484653 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11011200200001 its reverse (10000200211011), we get a palindrome (21011400411012).
The spelling of 11011200200001 in words is "eleven trillion, eleven billion, two hundred million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •