Search a number
-
+
145507461368513 is a prime number
BaseRepresentation
bin100001000101011010011000…
…100011000000101011000001
3201002012101012011110011122212
4201011122120203000223001
5123032443240102243023
61233245112133511505
742435365352355556
oct4105323043005301
9632171164404585
10145507461368513
11423aa405630862
12143a03a24a2595
1363263aa6a5a8a
1427d0854bd0a2d
1511c4eb28e1e78
hex8456988c0ac1

145507461368513 has 2 divisors, whose sum is σ = 145507461368514. Its totient is φ = 145507461368512.

The previous prime is 145507461368483. The next prime is 145507461368519. The reversal of 145507461368513 is 315863164705541.

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., 140677343119504 + 4830118249009 = 11860748^2 + 2197753^2 .

It is a cyclic number.

It is not a de Polignac number, because 145507461368513 - 26 = 145507461368449 is a prime.

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 (145507461368519) 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, 72753730684256 + 72753730684257.

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

Almost surely, 2145507461368513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36288000, while the sum is 59.

The spelling of 145507461368513 in words is "one hundred forty-five trillion, five hundred seven billion, four hundred sixty-one million, three hundred sixty-eight thousand, five hundred thirteen".