Base | Representation |
---|---|
bin | 100001000111011… |
… | …1101111100110101 |
3 | 2212102221211022002 |
4 | 1002032331330311 |
5 | 4233433020041 |
6 | 302133145045 |
7 | 36352133342 |
oct | 10216757465 |
9 | 2772854262 |
10 | 1111220021 |
11 | 52028905a |
12 | 27018b185 |
13 | 1492ab952 |
14 | a781d7c9 |
15 | 6785059b |
hex | 423bdf35 |
1111220021 has 2 divisors, whose sum is σ = 1111220022. Its totient is φ = 1111220020.
The previous prime is 1111220009. The next prime is 1111220027. The reversal of 1111220021 is 1200221111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1108157521 + 3062500 = 33289^2 + 1750^2 .
It is an emirp because it is prime and its reverse (1200221111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1111220021 - 26 = 1111219957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111219984 and 1111220011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111220027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555610010 + 555610011.
It is an arithmetic number, because the mean of its divisors is an integer number (555610011).
Almost surely, 21111220021 is an apocalyptic number.
It is an amenable number.
1111220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111220021 is an equidigital number, since it uses as much as digits as its factorization.
1111220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 1111220021 is about 33334.9669416365. The cubic root of 1111220021 is about 1035.7780083804.
Adding to 1111220021 its reverse (1200221111), we get a palindrome (2311441132).
The spelling of 1111220021 in words is "one billion, one hundred eleven million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •