Search a number
-
+
145693682177 is a prime number
BaseRepresentation
bin1000011110110000000…
…1010010101000000001
3111221001122100220100212
42013230001102220001
54341340040312202
6150533013123505
713345265602541
oct2075401225001
9457048326325
10145693682177
11568743158aa
12242a0629595
131097b35a3c4
1470a18a1321
153bca9ed652
hex21ec052a01

145693682177 has 2 divisors, whose sum is σ = 145693682178. Its totient is φ = 145693682176.

The previous prime is 145693682171. The next prime is 145693682179. The reversal of 145693682177 is 771286396541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 139792984321 + 5900697856 = 373889^2 + 76816^2 .

It is a cyclic number.

It is not a de Polignac number, because 145693682177 - 24 = 145693682161 is a prime.

Together with 145693682179, it forms a pair of twin primes.

It is a Chen prime.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2145693682177 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 15240960, while the sum is 59.

The spelling of 145693682177 in words is "one hundred forty-five billion, six hundred ninety-three million, six hundred eighty-two thousand, one hundred seventy-seven".