Base | Representation |
---|---|
bin | 1000001111001001… |
… | …1000000101000001 |
3 | 12201002102111210011 |
4 | 2003302120011001 |
5 | 14012010133441 |
6 | 1003221504521 |
7 | 105535240501 |
oct | 20362300501 |
9 | 5632374704 |
10 | 2211021121 |
11 | a35077991 |
12 | 518572141 |
13 | 2930bcc2a |
14 | 16d909a01 |
15 | ce197581 |
hex | 83c98141 |
2211021121 has 2 divisors, whose sum is σ = 2211021122. Its totient is φ = 2211021120.
The previous prime is 2211021101. The next prime is 2211021133. The reversal of 2211021121 is 1211201122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1410753600 + 800267521 = 37560^2 + 28289^2 .
It is a cyclic number.
It is not a de Polignac number, because 2211021121 - 213 = 2211012929 is a prime.
It is a super-2 number, since 2×22110211212 = 9777228795016193282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2211021101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1105510560 + 1105510561.
It is an arithmetic number, because the mean of its divisors is an integer number (1105510561).
Almost surely, 22211021121 is an apocalyptic number.
It is an amenable number.
2211021121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211021121 is an equidigital number, since it uses as much as digits as its factorization.
2211021121 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 13.
The square root of 2211021121 is about 47021.4963713406. The cubic root of 2211021121 is about 1302.7596447713.
Adding to 2211021121 its reverse (1211201122), we get a palindrome (3422222243).
The spelling of 2211021121 in words is "two billion, two hundred eleven million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •