Base | Representation |
---|---|
bin | 1000001111001011… |
… | …0000100010101001 |
3 | 12201002121121020021 |
4 | 2003302300202221 |
5 | 14012021340241 |
6 | 1003224000441 |
7 | 105536135563 |
oct | 20362604251 |
9 | 5632547207 |
10 | 2211121321 |
11 | a351361a2 |
12 | 518600121 |
13 | 293126716 |
14 | 16d934333 |
15 | ce1b70d1 |
hex | 83cb08a9 |
2211121321 has 2 divisors, whose sum is σ = 2211121322. Its totient is φ = 2211121320.
The previous prime is 2211121313. The next prime is 2211121331. The reversal of 2211121321 is 1231211122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2177248921 + 33872400 = 46661^2 + 5820^2 .
It is a cyclic number.
It is not a de Polignac number, because 2211121321 - 23 = 2211121313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2211121295 and 2211121304.
It is not a weakly prime, because it can be changed into another prime (2211121301) 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, 1105560660 + 1105560661.
It is an arithmetic number, because the mean of its divisors is an integer number (1105560661).
Almost surely, 22211121321 is an apocalyptic number.
It is an amenable number.
2211121321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211121321 is an equidigital number, since it uses as much as digits as its factorization.
2211121321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 16.
The square root of 2211121321 is about 47022.5618294027. The cubic root of 2211121321 is about 1302.7793241468.
Adding to 2211121321 its reverse (1231211122), we get a palindrome (3442332443).
The spelling of 2211121321 in words is "two billion, two hundred eleven million, one hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •