Search a number
-
+
150639007889 is a prime number
BaseRepresentation
bin1000110001001011001…
…0001101100010010001
3112101211021212110220102
42030102302031202101
54432002041223024
6153111432422145
713611655304006
oct2142262154221
9471737773812
10150639007889
115898187a247
1225240847955
1311288a85136
1474105ad8ad
153db9c551ae
hex2312c8d891

150639007889 has 2 divisors, whose sum is σ = 150639007890. Its totient is φ = 150639007888.

The previous prime is 150639007811. The next prime is 150639007891. The reversal of 150639007889 is 988700936051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 79780827025 + 70858180864 = 282455^2 + 266192^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 150639007889 - 224 = 150622230673 is a prime.

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

Together with 150639007891, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2150639007889 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 56.

The spelling of 150639007889 in words is "one hundred fifty billion, six hundred thirty-nine million, seven thousand, eight hundred eighty-nine".