Search a number
-
+
145639979141 is a prime number
BaseRepresentation
bin1000011110100011010…
…0011011100010000101
3111220220220022111122112
42013220310123202011
54341232313313031
6150523414110405
713344044253116
oct2075064334205
9456826274575
10145639979141
1156846a75a28
122428664b405
13109701a6667
1470986c220d
153bc5e4162b
hex21e8d1b885

145639979141 has 2 divisors, whose sum is σ = 145639979142. Its totient is φ = 145639979140.

The previous prime is 145639979129. The next prime is 145639979143. The reversal of 145639979141 is 141979936541.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 116028796900 + 29611182241 = 340630^2 + 172079^2 .

It is a cyclic number.

It is not a de Polignac number, because 145639979141 - 226 = 145572870277 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2145639979141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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