Base | Representation |
---|---|
bin | 10100011111010011… |
… | …01011010111010001 |
3 | 1001101121102222222112 |
4 | 22033221223113101 |
5 | 140012000031001 |
6 | 5015304115105 |
7 | 536406321452 |
oct | 121751532721 |
9 | 31347388875 |
10 | 11000002001 |
11 | 473523a34a |
12 | 216ba65a95 |
13 | 1063c28531 |
14 | 764cb1129 |
15 | 445a8ecbb |
hex | 28fa6b5d1 |
11000002001 has 2 divisors, whose sum is σ = 11000002002. Its totient is φ = 11000002000.
The previous prime is 11000001983. The next prime is 11000002009. The reversal of 11000002001 is 10020000011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7953072400 + 3046929601 = 89180^2 + 55199^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000002001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11000002009) 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, 5500001000 + 5500001001.
It is an arithmetic number, because the mean of its divisors is an integer number (5500001001).
Almost surely, 211000002001 is an apocalyptic number.
It is an amenable number.
11000002001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000002001 is an equidigital number, since it uses as much as digits as its factorization.
11000002001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 5.
Adding to 11000002001 its reverse (10020000011), we get a palindrome (21020002012).
The spelling of 11000002001 in words is "eleven billion, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •