Base | Representation |
---|---|
bin | 1010000000011010000011… |
… | …0111101100110010101001 |
3 | 1102221210100222100222220001 |
4 | 2200012200313230302221 |
5 | 2420224310202413001 |
6 | 35222144420303001 |
7 | 2213606355454663 |
oct | 240064067546251 |
9 | 42853328328801 |
10 | 11002110201001 |
11 | 3561a72425187 |
12 | 1298348541a61 |
13 | 61a6576740ba |
14 | 2a070d919533 |
15 | 1412cba89001 |
hex | a01a0decca9 |
11002110201001 has 2 divisors, whose sum is σ = 11002110201002. Its totient is φ = 11002110201000.
The previous prime is 11002110200999. The next prime is 11002110201007. The reversal of 11002110201001 is 10010201120011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10825646355225 + 176463845776 = 3290235^2 + 420076^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002110201001 - 21 = 11002110200999 is a prime.
Together with 11002110200999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11002110201007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501055100500 + 5501055100501.
It is an arithmetic number, because the mean of its divisors is an integer number (5501055100501).
Almost surely, 211002110201001 is an apocalyptic number.
It is an amenable number.
11002110201001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002110201001 is an equidigital number, since it uses as much as digits as its factorization.
11002110201001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11002110201001 its reverse (10010201120011), we get a palindrome (21012311321012).
The spelling of 11002110201001 in words is "eleven trillion, two billion, one hundred ten million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •