Search a number
-
+
153962064397 is a prime number
BaseRepresentation
bin1000111101100011011…
…0101010101000001101
3112201101212210020110101
42033120312222220031
510010303242030042
6154421301211101
714060215645261
oct2173066525015
9481355706411
10153962064397
115a327631839
1225a09700a91
131169837ab6b
147647a6c0a1
15401185e6b7
hex23d8daaa0d

153962064397 has 2 divisors, whose sum is σ = 153962064398. Its totient is φ = 153962064396.

The previous prime is 153962064371. The next prime is 153962064401. The reversal of 153962064397 is 793460269351.

153962064397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114419151081 + 39542913316 = 338259^2 + 198854^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 2153962064397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7348320, while the sum is 55.

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