Search a number
-
+
145605557 is a prime number
BaseRepresentation
bin10001010110111…
…00001110110101
3101010222112021102
420223130032311
5244233334212
622240455445
73415424666
oct1053341665
9333875242
10145605557
1175210679
124091a585
1324220946
14154a336d
15cbb25c2
hex8adc3b5

145605557 has 2 divisors, whose sum is σ = 145605558. Its totient is φ = 145605556.

The previous prime is 145605517. The next prime is 145605599. The reversal of 145605557 is 755506541.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97732996 + 47872561 = 9886^2 + 6919^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2145605557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 105000, while the sum is 38.

The square root of 145605557 is about 12066.7127669469. The cubic root of 145605557 is about 526.0891156292.

The spelling of 145605557 in words is "one hundred forty-five million, six hundred five thousand, five hundred fifty-seven".