Search a number
-
+
145122352060313 is a prime number
BaseRepresentation
bin100000111111110011101110…
…001111100101011110011001
3201000211120011020100022200202
4200333303232033211132121
5123010141034111412223
61232352142124511545
742365513112303305
oct4077635617453631
9630746136308622
10145122352060313
1142271053451621
12143398260ab5b5
1362c8c96061294
1427b9d6051ad05
1511b9e7341a428
hex83fcee3e5799

145122352060313 has 2 divisors, whose sum is σ = 145122352060314. Its totient is φ = 145122352060312.

The previous prime is 145122352060219. The next prime is 145122352060379. The reversal of 145122352060313 is 313060253221541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77092386171529 + 68029965888784 = 8780227^2 + 8248028^2 .

It is a cyclic number.

It is not a de Polignac number, because 145122352060313 - 28 = 145122352060057 is a prime.

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

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

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

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

Almost surely, 2145122352060313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 145122352060313 in words is "one hundred forty-five trillion, one hundred twenty-two billion, three hundred fifty-two million, sixty thousand, three hundred thirteen".