Base | Representation |
---|---|
bin | 1010000000111110111001… |
… | …1110011000010111110001 |
3 | 1102222201220100202121101212 |
4 | 2200033232132120113301 |
5 | 2420410040020334301 |
6 | 35230502142405505 |
7 | 2214406451423324 |
oct | 240175636302761 |
9 | 42881810677355 |
10 | 11012002121201 |
11 | 356618912a244 |
12 | 129a249290895 |
13 | 61b572b4c213 |
14 | 2a0dab5867bb |
15 | 1416aa1e84bb |
hex | a03ee7985f1 |
11012002121201 has 2 divisors, whose sum is σ = 11012002121202. Its totient is φ = 11012002121200.
The previous prime is 11012002121173. The next prime is 11012002121227. The reversal of 11012002121201 is 10212120021011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9860705310976 + 1151296810225 = 3140176^2 + 1072985^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012002121201 - 218 = 11012001859057 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 (11012004121201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506001060600 + 5506001060601.
It is an arithmetic number, because the mean of its divisors is an integer number (5506001060601).
Almost surely, 211012002121201 is an apocalyptic number.
It is an amenable number.
11012002121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012002121201 is an equidigital number, since it uses as much as digits as its factorization.
11012002121201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11012002121201 its reverse (10212120021011), we get a palindrome (21224122142212).
The spelling of 11012002121201 in words is "eleven trillion, twelve billion, two million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •