Search a number
-
+
68911231 is a prime number
BaseRepresentation
bin1000001101110…
…00000001111111
311210200001102211
410012320001333
5120120124411
610501001251
71464510244
oct406700177
9153601384
1068911231
1135998034
121b0b3227
131137a09c
14921b5cb
1560b3221
hex41b807f

68911231 has 2 divisors, whose sum is σ = 68911232. Its totient is φ = 68911230.

The previous prime is 68911211. The next prime is 68911247. The reversal of 68911231 is 13211986.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 68911231 - 29 = 68910719 is a prime.

It is a super-2 number, since 2×689112312 = 9497515515870722, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 268911231 is an apocalyptic number.

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

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

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

The product of its digits is 2592, while the sum is 31.

The square root of 68911231 is about 8301.2788773779. The cubic root of 68911231 is about 409.9806276788.

The spelling of 68911231 in words is "sixty-eight million, nine hundred eleven thousand, two hundred thirty-one".