Base | Representation |
---|---|
bin | 11000000110101… |
… | …10001111010101 |
3 | 112002111000220101 |
4 | 30003112033111 |
5 | 403231012432 |
6 | 32021534101 |
7 | 5003464243 |
oct | 1403261725 |
9 | 462430811 |
10 | 202204117 |
11 | a4158a45 |
12 | 57874331 |
13 | 32b7960b |
14 | 1cbd7793 |
15 | 12b424e7 |
hex | c0d63d5 |
202204117 has 2 divisors, whose sum is σ = 202204118. Its totient is φ = 202204116.
The previous prime is 202204073. The next prime is 202204129. The reversal of 202204117 is 711402202.
It is a happy number.
202204117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 160807761 + 41396356 = 12681^2 + 6434^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202204117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202204094 and 202204103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202204217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101102058 + 101102059.
It is an arithmetic number, because the mean of its divisors is an integer number (101102059).
Almost surely, 2202204117 is an apocalyptic number.
It is an amenable number.
202204117 is a deficient number, since it is larger than the sum of its proper divisors (1).
202204117 is an equidigital number, since it uses as much as digits as its factorization.
202204117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 19.
The square root of 202204117 is about 14219.8494014529. The cubic root of 202204117 is about 586.9439961971.
Adding to 202204117 its reverse (711402202), we get a palindrome (913606319).
The spelling of 202204117 in words is "two hundred two million, two hundred four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •