Base | Representation |
---|---|
bin | 111100111011011… |
… | …000100100110101 |
3 | 2122020110010221121 |
4 | 330323120210311 |
5 | 4043140400432 |
6 | 245233143541 |
7 | 34221362161 |
oct | 7473304465 |
9 | 2566403847 |
10 | 1022200117 |
11 | 485007094 |
12 | 2463babb1 |
13 | 133a10b53 |
14 | 99a89ca1 |
15 | 5eb19197 |
hex | 3ced8935 |
1022200117 has 2 divisors, whose sum is σ = 1022200118. Its totient is φ = 1022200116.
The previous prime is 1022200079. The next prime is 1022200129. The reversal of 1022200117 is 7110022201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 532640241 + 489559876 = 23079^2 + 22126^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022200117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1022200117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1022200717) 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, 511100058 + 511100059.
It is an arithmetic number, because the mean of its divisors is an integer number (511100059).
Almost surely, 21022200117 is an apocalyptic number.
It is an amenable number.
1022200117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022200117 is an equidigital number, since it uses as much as digits as its factorization.
1022200117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 1022200117 is about 31971.8644592398. The cubic root of 1022200117 is about 1007.3459439710.
Adding to 1022200117 its reverse (7110022201), we get a palindrome (8132222318).
The spelling of 1022200117 in words is "one billion, twenty-two million, two hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •