Search a number
-
+
89090476150309 is a prime number
BaseRepresentation
bin10100010000011011111110…
…001011110000111000100101
3102200102222002110111111112021
4110100123332023300320211
543134124243343302214
6513251333313023141
724523401023354524
oct2420337613607045
9380388073444467
1089090476150309
1126429071226107
129baa3b8254ab1
133a9327139880a
1418000058c24bb
15a476ab198924
hex5106fe2f0e25

89090476150309 has 2 divisors, whose sum is σ = 89090476150310. Its totient is φ = 89090476150308.

The previous prime is 89090476150253. The next prime is 89090476150349. The reversal of 89090476150309 is 90305167409098.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 72209035808100 + 16881440342209 = 8497590^2 + 4108703^2 .

It is a cyclic number.

It is not a de Polignac number, because 89090476150309 - 213 = 89090476142117 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 289090476150309 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 89090476150309 in words is "eighty-nine trillion, ninety billion, four hundred seventy-six million, one hundred fifty thousand, three hundred nine".