Search a number
-
+
42145119901193 is a prime number
BaseRepresentation
bin10011001010100101011001…
…11001101001011000001001
312112020000220212110200002212
421211102230321221120021
521011001201143314233
6225345111212234505
711606612234255531
oct1145225471513011
9175200825420085
1042145119901193
11124797105105a1
12488800b46ba35
131a6936334064a
14a59b9854a4c1
154d1458158a48
hex2654ace69609

42145119901193 has 2 divisors, whose sum is σ = 42145119901194. Its totient is φ = 42145119901192.

The previous prime is 42145119901091. The next prime is 42145119901211. The reversal of 42145119901193 is 39110991154124.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 23361494557129 + 18783625344064 = 4833373^2 + 4334008^2 .

It is a cyclic number.

It is not a de Polignac number, because 42145119901193 - 28 = 42145119900937 is a prime.

It is a super-2 number, since 2×421451199011932 (a number of 28 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 242145119901193 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 42145119901193 in words is "forty-two trillion, one hundred forty-five billion, one hundred nineteen million, nine hundred one thousand, one hundred ninety-three".