Search a number
-
+
89364152719 is a prime number
BaseRepresentation
bin101001100111010000…
…1001100000110001111
322112122221102022122001
41103032201030012033
52431004210341334
6105015303533131
76312345523252
oct1231641140617
9275587368561
1089364152719
1134998809676
121539ba5a1a7
13857218509a
14447a6a3099
1524d062c714
hex14ce84c18f

89364152719 has 2 divisors, whose sum is σ = 89364152720. Its totient is φ = 89364152718.

The previous prime is 89364152701. The next prime is 89364152741. The reversal of 89364152719 is 91725146398.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 89364152719 - 217 = 89364021647 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 89364152719.

It is a congruent number.

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

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

Almost surely, 289364152719 is an apocalyptic number.

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

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

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

The product of its digits is 3265920, while the sum is 55.

The spelling of 89364152719 in words is "eighty-nine billion, three hundred sixty-four million, one hundred fifty-two thousand, seven hundred nineteen".