Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1111010011010010110001 |
3 | 1102222122220000020121211022 |
4 | 2200032333333103102301 |
5 | 2420401440342101001 |
6 | 35230252522425225 |
7 | 2214351231405611 |
oct | 240167777232261 |
9 | 42878800217738 |
10 | 11011222222001 |
11 | 3565918978451 |
12 | 129a070062215 |
13 | 61b47a3b65c1 |
14 | 2a0d35b70a41 |
15 | 1416619e211b |
hex | a03bffd34b1 |
11011222222001 has 2 divisors, whose sum is σ = 11011222222002. Its totient is φ = 11011222222000.
The previous prime is 11011222221983. The next prime is 11011222222057. The reversal of 11011222222001 is 10022222211011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5524267341376 + 5486954880625 = 2350376^2 + 2342425^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011222222001 - 214 = 11011222205617 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 (11011222222061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505611111000 + 5505611111001.
It is an arithmetic number, because the mean of its divisors is an integer number (5505611111001).
Almost surely, 211011222222001 is an apocalyptic number.
It is an amenable number.
11011222222001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011222222001 is an equidigital number, since it uses as much as digits as its factorization.
11011222222001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11011222222001 its reverse (10022222211011), we get a palindrome (21033444433012).
The spelling of 11011222222001 in words is "eleven trillion, eleven billion, two hundred twenty-two million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •