Base | Representation |
---|---|
bin | 1000001111011000… |
… | …1001110000100001 |
3 | 12201011021210200212 |
4 | 2003312021300201 |
5 | 14012233323131 |
6 | 1003255023505 |
7 | 105546532532 |
oct | 20366116041 |
9 | 5634253625 |
10 | 2212011041 |
11 | a356936a9 |
12 | 51896ab95 |
13 | 293378696 |
14 | 16dac6689 |
15 | ce2e0a2b |
hex | 83d89c21 |
2212011041 has 2 divisors, whose sum is σ = 2212011042. Its totient is φ = 2212011040.
The previous prime is 2212011023. The next prime is 2212011059. The reversal of 2212011041 is 1401102122.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (2212011023) and next prime (2212011059).
It can be written as a sum of positive squares in only one way, i.e., 2086571041 + 125440000 = 45679^2 + 11200^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2212011041 is a prime.
It is not a weakly prime, because it can be changed into another prime (2212011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106005520 + 1106005521.
It is an arithmetic number, because the mean of its divisors is an integer number (1106005521).
Almost surely, 22212011041 is an apocalyptic number.
It is an amenable number.
2212011041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212011041 is an equidigital number, since it uses as much as digits as its factorization.
2212011041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 2212011041 is about 47032.0214428425. The cubic root of 2212011041 is about 1302.9540399309.
Adding to 2212011041 its reverse (1401102122), we get a palindrome (3613113163).
The spelling of 2212011041 in words is "two billion, two hundred twelve million, eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •