Search a number
-
+
241016117 is a prime number
BaseRepresentation
bin11100101110110…
…01110100110101
3121210111212221212
432113121310311
5443200003432
635525451205
75654413616
oct1627316465
9553455855
10241016117
11114057a81
1268870b05
133ac184b4
142401bc0d
151625c2b2
hexe5d9d35

241016117 has 2 divisors, whose sum is σ = 241016118. Its totient is φ = 241016116.

The previous prime is 241016099. The next prime is 241016119. The reversal of 241016117 is 711610142.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 213568996 + 27447121 = 14614^2 + 5239^2 .

It is a cyclic number.

It is not a de Polignac number, because 241016117 - 26 = 241016053 is a prime.

Together with 241016119, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 241016092 and 241016101.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (241016119) 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, 120508058 + 120508059.

It is an arithmetic number, because the mean of its divisors is an integer number (120508059).

Almost surely, 2241016117 is an apocalyptic number.

It is an amenable number.

241016117 is a deficient number, since it is larger than the sum of its proper divisors (1).

241016117 is an equidigital number, since it uses as much as digits as its factorization.

241016117 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 336, while the sum is 23.

The square root of 241016117 is about 15524.6937811990. The cubic root of 241016117 is about 622.3222974109.

Adding to 241016117 its reverse (711610142), we get a palindrome (952626259).

The spelling of 241016117 in words is "two hundred forty-one million, sixteen thousand, one hundred seventeen".