Base | Representation |
---|---|
bin | 100001011100011… |
… | …1101001110011101 |
3 | 2220012200001011201 |
4 | 1002320331032131 |
5 | 4244242231401 |
6 | 303205115501 |
7 | 36544526062 |
oct | 10270751635 |
9 | 2805601151 |
10 | 1122227101 |
11 | 526516916 |
12 | 2739b8b91 |
13 | 14b663a08 |
14 | a9086c69 |
15 | 687c6b01 |
hex | 42e3d39d |
1122227101 has 2 divisors, whose sum is σ = 1122227102. Its totient is φ = 1122227100.
The previous prime is 1122227087. The next prime is 1122227111. The reversal of 1122227101 is 1017222211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1122183001 + 44100 = 33499^2 + 210^2 .
It is an emirp because it is prime and its reverse (1017222211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1122227101 - 223 = 1113838493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122227111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561113550 + 561113551.
It is an arithmetic number, because the mean of its divisors is an integer number (561113551).
Almost surely, 21122227101 is an apocalyptic number.
It is an amenable number.
1122227101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122227101 is an equidigital number, since it uses as much as digits as its factorization.
1122227101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
The square root of 1122227101 is about 33499.6582221371. The cubic root of 1122227101 is about 1039.1867103813.
Adding to 1122227101 its reverse (1017222211), we get a palindrome (2139449312).
The spelling of 1122227101 in words is "one billion, one hundred twenty-two million, two hundred twenty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •