Search a number
-
+
145617559601 is a prime number
BaseRepresentation
bin1000011110011101111…
…0111010000000110001
3111220212100010110211012
42013213132322000301
54341211043401401
6150521253400305
713343352556043
oct2074736720061
9456770113735
10145617559601
1156835352888
122427b039095
1310968656b67
147095727a93
153bc3eb38bb
hex21e77ba031

145617559601 has 2 divisors, whose sum is σ = 145617559602. Its totient is φ = 145617559600.

The previous prime is 145617559573. The next prime is 145617559609. The reversal of 145617559601 is 106955716541.

145617559601 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., 137178381376 + 8439178225 = 370376^2 + 91865^2 .

It is a cyclic number.

It is not a de Polignac number, because 145617559601 - 222 = 145613365297 is a prime.

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

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

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

Almost surely, 2145617559601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1134000, while the sum is 50.

The spelling of 145617559601 in words is "one hundred forty-five billion, six hundred seventeen million, five hundred fifty-nine thousand, six hundred one".