Base | Representation |
---|---|
bin | 1010001100101000010111… |
… | …1100111111101111010001 |
3 | 1110200212102100210211000112 |
4 | 2203022011330333233101 |
5 | 2432144401133031001 |
6 | 35502434555531105 |
7 | 2235022405354451 |
oct | 243120574775721 |
9 | 43625370724015 |
10 | 11212112002001 |
11 | 3633036a20519 |
12 | 1310b95759a95 |
13 | 6343b3b61401 |
14 | 2aa9520abd61 |
15 | 1469bd124cbb |
hex | a3285f3fbd1 |
11212112002001 has 2 divisors, whose sum is σ = 11212112002002. Its totient is φ = 11212112002000.
The previous prime is 11212112001991. The next prime is 11212112002009. The reversal of 11212112002001 is 10020021121211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6274028049601 + 4938083952400 = 2504801^2 + 2222180^2 .
It is a cyclic number.
It is not a de Polignac number, because 11212112002001 - 238 = 10937234095057 is a prime.
It is a super-2 number, since 2×112121120020012 (a number of 27 digits) contains 22 as substring.
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 (11212112002009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606056001000 + 5606056001001.
It is an arithmetic number, because the mean of its divisors is an integer number (5606056001001).
Almost surely, 211212112002001 is an apocalyptic number.
It is an amenable number.
11212112002001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212112002001 is an equidigital number, since it uses as much as digits as its factorization.
11212112002001 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 11212112002001 its reverse (10020021121211), we get a palindrome (21232133123212).
The spelling of 11212112002001 in words is "eleven trillion, two hundred twelve billion, one hundred twelve million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •