Base | Representation |
---|---|
bin | 100001000111010… |
… | …0110000111110101 |
3 | 2212102202212102021 |
4 | 1002032212013311 |
5 | 4233421404141 |
6 | 302131113141 |
7 | 36351245653 |
oct | 10216460765 |
9 | 2772685367 |
10 | 1111122421 |
11 | 5202217a2 |
12 | 2701427b1 |
13 | 1492763b6 |
14 | a77d5dd3 |
15 | 678316d1 |
hex | 423a61f5 |
1111122421 has 2 divisors, whose sum is σ = 1111122422. Its totient is φ = 1111122420.
The previous prime is 1111122403. The next prime is 1111122437. The reversal of 1111122421 is 1242211111.
It is an a-pointer prime, because the next prime (1111122437) can be obtained adding 1111122421 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 934524900 + 176597521 = 30570^2 + 13289^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111122421 - 213 = 1111114229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111122395 and 1111122404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111122121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555561210 + 555561211.
It is an arithmetic number, because the mean of its divisors is an integer number (555561211).
Almost surely, 21111122421 is an apocalyptic number.
It is an amenable number.
1111122421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111122421 is an equidigital number, since it uses as much as digits as its factorization.
1111122421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32, while the sum is 16.
The square root of 1111122421 is about 33333.5029812350. The cubic root of 1111122421 is about 1035.7476828848.
Adding to 1111122421 its reverse (1242211111), we get a palindrome (2353333532).
The spelling of 1111122421 in words is "one billion, one hundred eleven million, one hundred twenty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •