Base | Representation |
---|---|
bin | 100000001011011101010… |
… | …001001000000010100101 |
3 | 21211101211001221201022001 |
4 | 200023131101020002211 |
5 | 242212243303204021 |
6 | 4411511402405301 |
7 | 315522464100013 |
oct | 40133521100245 |
9 | 7741731851261 |
10 | 2211325444261 |
11 | 7828aa62297a |
12 | 2b86a0500831 |
13 | 1306b104714b |
14 | 79058b598b3 |
15 | 3c7c5879091 |
hex | 202dd4480a5 |
2211325444261 has 2 divisors, whose sum is σ = 2211325444262. Its totient is φ = 2211325444260.
The previous prime is 2211325444189. The next prime is 2211325444267. The reversal of 2211325444261 is 1624445231122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1429533488161 + 781791956100 = 1195631^2 + 884190^2 .
It is a cyclic number.
It is not a de Polignac number, because 2211325444261 - 213 = 2211325436069 is a prime.
It is a super-2 number, since 2×22113254442612 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2211325444261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2211325444267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1105662722130 + 1105662722131.
It is an arithmetic number, because the mean of its divisors is an integer number (1105662722131).
Almost surely, 22211325444261 is an apocalyptic number.
It is an amenable number.
2211325444261 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211325444261 is an equidigital number, since it uses as much as digits as its factorization.
2211325444261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 92160, while the sum is 37.
The spelling of 2211325444261 in words is "two trillion, two hundred eleven billion, three hundred twenty-five million, four hundred forty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •