Search a number
-
+
145565601637 is a prime number
BaseRepresentation
bin1000011110010001100…
…0101100111101100101
3111220201201100201220011
42013210120230331211
54341104243223022
6150512200010221
713342152125101
oct2074430547545
9456651321804
10145565601637
1156808a95015
1224265760971
131095a9644c1
14708c880901
153bbe64d977
hex21e462cf65

145565601637 has 2 divisors, whose sum is σ = 145565601638. Its totient is φ = 145565601636.

The previous prime is 145565601547. The next prime is 145565601647. The reversal of 145565601637 is 736106565541.

145565601637 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., 95052589636 + 50513012001 = 308306^2 + 224751^2 .

It is a cyclic number.

It is not a de Polignac number, because 145565601637 - 223 = 145557213029 is a prime.

It is a congruent number.

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

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

Almost surely, 2145565601637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2268000, while the sum is 49.

The spelling of 145565601637 in words is "one hundred forty-five billion, five hundred sixty-five million, six hundred one thousand, six hundred thirty-seven".