Base | Representation |
---|---|
bin | 1010000000111011111010… |
… | …1010100100101111000001 |
3 | 1102222122211110110012100002 |
4 | 2200032332222210233001 |
5 | 2420401414200324301 |
6 | 35230250410405345 |
7 | 2214350541541235 |
oct | 240167652445701 |
9 | 42878743405302 |
10 | 11011200011201 |
11 | 3565907388115 |
12 | 129a064730855 |
13 | 61b47590ab10 |
14 | 2a0d32c2c5c5 |
15 | 14165eaa616b |
hex | a03beaa4bc1 |
11011200011201 has 8 divisors (see below), whose sum is σ = 11967006365160. Its totient is φ = 10070935224192.
The previous prime is 11011200011197. The next prime is 11011200011261. The reversal of 11011200011201 is 10211000211011.
It can be written as a sum of positive squares in 4 ways, for example, as 2130943050625 + 8880256960576 = 1459775^2 + 2979976^2 .
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 11011200011201 - 22 = 11011200011197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11011200011261) 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, 3885390260 + ... + 3885393093.
It is an arithmetic number, because the mean of its divisors is an integer number (1495875795645).
Almost surely, 211011200011201 is an apocalyptic number.
It is an amenable number.
11011200011201 is a deficient number, since it is larger than the sum of its proper divisors (955806353959).
11011200011201 is a wasteful number, since it uses less digits than its factorization.
11011200011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7770783475.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011200011201 its reverse (10211000211011), we get a palindrome (21222200222212).
The spelling of 11011200011201 in words is "eleven trillion, eleven billion, two hundred million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •