Search a number
-
+
23402297 is a prime number
BaseRepresentation
bin101100101000…
…1011100111001
31122000221220202
41121101130321
521442333142
62153331545
7402626162
oct131213471
948027822
1023402297
1112234546
127a06bb5
134b04c19
143172769
1520c4032
hex1651739

23402297 has 2 divisors, whose sum is σ = 23402298. Its totient is φ = 23402296.

The previous prime is 23402279. The next prime is 23402299. The reversal of 23402297 is 79220432.

It is a happy number.

Together with previous prime (23402279) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12538681 + 10863616 = 3541^2 + 3296^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-23402297 is a prime.

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

It is a Chen prime.

It is equal to p1471952 and since 23402297 and 1471952 have the same sum of digits, it is a Honaker prime.

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

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

Almost surely, 223402297 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6048, while the sum is 29.

The square root of 23402297 is about 4837.5920663074. The cubic root of 23402297 is about 286.0352092861.

The spelling of 23402297 in words is "twenty-three million, four hundred two thousand, two hundred ninety-seven".