Base | Representation |
---|---|
bin | 1010000000011010000011… |
… | …1010101111111010001001 |
3 | 1102221210101000212121012001 |
4 | 2200012200322233322021 |
5 | 2420224310404001301 |
6 | 35222144445351001 |
7 | 2213606365324006 |
oct | 240064072577211 |
9 | 42853330777161 |
10 | 11002111000201 |
11 | 3561a72920682 |
12 | 1298348868461 |
13 | 61a657893ab9 |
14 | 2a070da868ad |
15 | 1412cbb95c01 |
hex | a01a0eafe89 |
11002111000201 has 4 divisors (see below), whose sum is σ = 11005030110100. Its totient is φ = 10999191890304.
The previous prime is 11002111000151. The next prime is 11002111000207. The reversal of 11002111000201 is 10200011120011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5972407710201 + 5029703290000 = 2443851^2 + 2242700^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002111000201 - 29 = 11002110999689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11002111000207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1459549296 + ... + 1459556833.
It is an arithmetic number, because the mean of its divisors is an integer number (2751257527525).
Almost surely, 211002111000201 is an apocalyptic number.
It is an amenable number.
11002111000201 is a deficient number, since it is larger than the sum of its proper divisors (2919109899).
11002111000201 is an equidigital number, since it uses as much as digits as its factorization.
11002111000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2919109898.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11002111000201 its reverse (10200011120011), we get a palindrome (21202122120212).
The spelling of 11002111000201 in words is "eleven trillion, two billion, one hundred eleven million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •