Base | Representation |
---|---|
bin | 100001011100011… |
… | …0111001000000101 |
3 | 2220012121202220101 |
4 | 1002320313020011 |
5 | 4244240431432 |
6 | 303204404101 |
7 | 36544363201 |
oct | 10270671005 |
9 | 2805552811 |
10 | 1122202117 |
11 | 5264aa073 |
12 | 2739a6631 |
13 | 14b65552a |
14 | a907bb01 |
15 | 687be4e7 |
hex | 42e37205 |
1122202117 has 2 divisors, whose sum is σ = 1122202118. Its totient is φ = 1122202116.
The previous prime is 1122202087. The next prime is 1122202129. The reversal of 1122202117 is 7112022211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1111955716 + 10246401 = 33346^2 + 3201^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122202117 - 223 = 1113813509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1122202094 and 1122202103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122202517) 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, 561101058 + 561101059.
It is an arithmetic number, because the mean of its divisors is an integer number (561101059).
Almost surely, 21122202117 is an apocalyptic number.
It is an amenable number.
1122202117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122202117 is an equidigital number, since it uses as much as digits as its factorization.
1122202117 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 1122202117 is about 33499.2853207348. The cubic root of 1122202117 is about 1039.1789985633.
Adding to 1122202117 its reverse (7112022211), we get a palindrome (8234224328).
The spelling of 1122202117 in words is "one billion, one hundred twenty-two million, two hundred two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •