Search a number
-
+
989112552469 is a prime number
BaseRepresentation
bin11100110010010111011…
…00111100110000010101
310111120001221202210012121
432121023230330300111
5112201200303134334
62034220402415541
7131314062655336
oct16311354746025
93446057683177
10989112552469
11351531282478
1213b8439615b1
137237178b2b2
1435c324b428d
151aae0a0adb4
hexe64bb3cc15

989112552469 has 2 divisors, whose sum is σ = 989112552470. Its totient is φ = 989112552468.

The previous prime is 989112552433. The next prime is 989112552473. The reversal of 989112552469 is 964255211989.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 519030911844 + 470081640625 = 720438^2 + 685625^2 .

It is an emirp because it is prime and its reverse (964255211989) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 989112552469 - 27 = 989112552341 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2989112552469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 13996800, while the sum is 61.

The spelling of 989112552469 in words is "nine hundred eighty-nine billion, one hundred twelve million, five hundred fifty-two thousand, four hundred sixty-nine".