Search a number
-
+
989726814367 is a prime number
BaseRepresentation
bin11100110011100000101…
…00001011000010011111
310111121122202121112010021
432121300110023002133
5112203430031024432
62034401344253011
7131335232054344
oct16316024130237
93447582545107
10989726814367
11351816a91535
1213b995611167
137243bb0b585
1435c8dcd07cb
151ab298e4697
hexe67050b09f

989726814367 has 2 divisors, whose sum is σ = 989726814368. Its totient is φ = 989726814366.

The previous prime is 989726814343. The next prime is 989726814371. The reversal of 989726814367 is 763418627989.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-989726814367 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2989726814367 is an apocalyptic number.

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

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

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

The product of its digits is 219469824, while the sum is 70.

The spelling of 989726814367 in words is "nine hundred eighty-nine billion, seven hundred twenty-six million, eight hundred fourteen thousand, three hundred sixty-seven".