Search a number
-
+
145106137961 is a prime number
BaseRepresentation
bin1000011100100011111…
…1111111001101101001
3111212112200210120012222
42013020333333031221
54334134132403321
6150354424043425
713324602551621
oct2071077771551
9455480716188
10145106137961
11565a26a5174
1224157903575
13108b67030c5
14704783b881
153b941413ab
hex21c8fff369

145106137961 has 2 divisors, whose sum is σ = 145106137962. Its totient is φ = 145106137960.

The previous prime is 145106137877. The next prime is 145106137963. The reversal of 145106137961 is 169731601541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 93244729600 + 51861408361 = 305360^2 + 227731^2 .

It is an emirp because it is prime and its reverse (169731601541) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 145106137961 - 226 = 145039029097 is a prime.

Together with 145106137963, 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 (145106137963) by changing a digit.

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

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

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

Almost surely, 2145106137961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 136080, while the sum is 44.

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