Search a number
-
+
156706989313009 is a prime number
BaseRepresentation
bin100011101000011000110000…
…011011101000101111110001
3202112212001010112010122001111
4203220120300123220233301
5131014441403231004014
61313142110321433321
745002464165240132
oct4350306033505761
9675761115118044
10156706989313009
1145a28074140653
12156aaa4579b841
1369595373993c5
142a9a931887c89
15131b495d772c4
hex8e86306e8bf1

156706989313009 has 2 divisors, whose sum is σ = 156706989313010. Its totient is φ = 156706989313008.

The previous prime is 156706989312983. The next prime is 156706989313067. The reversal of 156706989313009 is 900313989607651.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82052291625984 + 74654697687025 = 9058272^2 + 8640295^2 .

It is a cyclic number.

It is not a de Polignac number, because 156706989313009 - 227 = 156706855095281 is a prime.

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

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

Almost surely, 2156706989313009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 66134880, while the sum is 67.

The spelling of 156706989313009 in words is "one hundred fifty-six trillion, seven hundred six billion, nine hundred eighty-nine million, three hundred thirteen thousand, nine".