Search a number
-
+
93059261 is a prime number
BaseRepresentation
bin1011000101111…
…11100010111101
320111002220022022
411202333202331
5142310344021
613122325525
72206663541
oct542774275
9214086268
1093059261
1148590889
12271b98a5
1316383569
14c505a21
1582831ab
hex58bf8bd

93059261 has 2 divisors, whose sum is σ = 93059262. Its totient is φ = 93059260.

The previous prime is 93059251. The next prime is 93059269. The reversal of 93059261 is 16295039.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 61136761 + 31922500 = 7819^2 + 5650^2 .

It is a cyclic number.

It is not a de Polignac number, because 93059261 - 214 = 93042877 is a prime.

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

It is a Chen prime.

It is equal to p5383880 and since 93059261 and 5383880 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

Almost surely, 293059261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 35.

The square root of 93059261 is about 9646.7228114008. The cubic root of 93059261 is about 453.1617025586.

The spelling of 93059261 in words is "ninety-three million, fifty-nine thousand, two hundred sixty-one".