Base | Representation |
---|---|
bin | 1010000000010010111100… |
… | …0001101101010111111001 |
3 | 1102221121102212102000112111 |
4 | 2200010233001231113321 |
5 | 2420211402224102301 |
6 | 35221231111012321 |
7 | 2213511134064451 |
oct | 240045701552771 |
9 | 42847385360474 |
10 | 11000200222201 |
11 | 3561182283903 |
12 | 1297ab496a0a1 |
13 | 61a411a58528 |
14 | 2a05abdb4d61 |
15 | 141219059551 |
hex | a012f06d5f9 |
11000200222201 has 8 divisors (see below), whose sum is σ = 11041215121800. Its totient is φ = 10959186226560.
The previous prime is 11000200222133. The next prime is 11000200222237. The reversal of 11000200222201 is 10222200200011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3292497346576 + 7707702875625 = 1814524^2 + 2776275^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 11000200222201 - 241 = 8801176966649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11000200222261) 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, 33534141 + ... + 33860581.
It is an arithmetic number, because the mean of its divisors is an integer number (1380151890225).
Almost surely, 211000200222201 is an apocalyptic number.
It is an amenable number.
11000200222201 is a deficient number, since it is larger than the sum of its proper divisors (41014899599).
11000200222201 is a wasteful number, since it uses less digits than its factorization.
11000200222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451979.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 11000200222201 its reverse (10222200200011), we get a palindrome (21222400422212).
The spelling of 11000200222201 in words is "eleven trillion, two hundred million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.727 sec. • engine limits •