Search a number
-
+
230091666853 is a prime number
BaseRepresentation
bin1101011001001010001…
…0000011010110100101
3210222220111001202011011
43112102202003112211
512232211431314403
6253411434542221
722423612620106
oct3262242032645
9728814052134
10230091666853
1189643824964
1238715297971
131890b69aac9
14b1ca78c3ad
155eba158a6d
hex35928835a5

230091666853 has 2 divisors, whose sum is σ = 230091666854. Its totient is φ = 230091666852.

The previous prime is 230091666821. The next prime is 230091666877. The reversal of 230091666853 is 358666190032.

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., 228362604129 + 1729062724 = 477873^2 + 41582^2 .

It is a cyclic number.

It is not a de Polignac number, because 230091666853 - 25 = 230091666821 is a prime.

It is a super-3 number, since 3×2300916668533 (a number of 35 digits) contains 333 as substring.

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

It is a congruent number.

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

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

Almost surely, 2230091666853 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1399680, while the sum is 49.

The spelling of 230091666853 in words is "two hundred thirty billion, ninety-one million, six hundred sixty-six thousand, eight hundred fifty-three".