Base | Representation |
---|---|
bin | 1010000000011010011000… |
… | …1110101101111101110001 |
3 | 1102221210121020120102012211 |
4 | 2200012212032231331301 |
5 | 2420230001212334301 |
6 | 35222201351452121 |
7 | 2213611526666002 |
oct | 240064616557561 |
9 | 42853536512184 |
10 | 11002200121201 |
11 | 35620091615a3 |
12 | 1298372687041 |
13 | 61a670198913 |
14 | 2a071b8451a9 |
15 | 1412d48ec051 |
hex | a01a63adf71 |
11002200121201 has 2 divisors, whose sum is σ = 11002200121202. Its totient is φ = 11002200121200.
The previous prime is 11002200121181. The next prime is 11002200121223. The reversal of 11002200121201 is 10212100220011.
11002200121201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6580533215025 + 4421666906176 = 2565255^2 + 2102776^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002200121201 - 29 = 11002200120689 is a prime.
It is not a weakly prime, because it can be changed into another prime (11002200125201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501100060600 + 5501100060601.
It is an arithmetic number, because the mean of its divisors is an integer number (5501100060601).
Almost surely, 211002200121201 is an apocalyptic number.
It is an amenable number.
11002200121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002200121201 is an equidigital number, since it uses as much as digits as its factorization.
11002200121201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11002200121201 its reverse (10212100220011), we get a palindrome (21214300341212).
The spelling of 11002200121201 in words is "eleven trillion, two billion, two hundred million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •