Search a number
-
+
93726690469 is a prime number
BaseRepresentation
bin101011101001010001…
…0111100110010100101
322221220222022012101021
41113102202330302211
53013423013043334
6111020224131141
76525430503226
oct1272242746245
9287828265337
1093726690469
1136827300875
12161b8a66ab1
138ab8c2c679
144771c2924d
1526886163b4
hex15d28bcca5

93726690469 has 2 divisors, whose sum is σ = 93726690470. Its totient is φ = 93726690468.

The previous prime is 93726690377. The next prime is 93726690479. The reversal of 93726690469 is 96409662739.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 83325750244 + 10400940225 = 288662^2 + 101985^2 .

It is a cyclic number.

It is not a de Polignac number, because 93726690469 - 213 = 93726682277 is a prime.

It is a super-2 number, since 2×937266904692 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (93726690479) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46863345234 + 46863345235.

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

Almost surely, 293726690469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26453952, while the sum is 61.

The spelling of 93726690469 in words is "ninety-three billion, seven hundred twenty-six million, six hundred ninety thousand, four hundred sixty-nine".