Search a number
-
+
146169750509 is a prime number
BaseRepresentation
bin1000100000100001100…
…1010110001111101101
3111222021211011200100022
42020020121112033231
54343323424004014
6151052141011525
713363136244056
oct2101031261755
9458254150308
10146169750509
1156a99017002
12243b3b53ba5
1310a25b83643
147108bc772d
153c076daa8e
hex22086563ed

146169750509 has 2 divisors, whose sum is σ = 146169750510. Its totient is φ = 146169750508.

The previous prime is 146169750499. The next prime is 146169750511. The reversal of 146169750509 is 905057961641.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102818346409 + 43351404100 = 320653^2 + 208210^2 .

It is a cyclic number.

It is not a de Polignac number, because 146169750509 - 236 = 77450273773 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (146169750589) 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, 73084875254 + 73084875255.

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

Almost surely, 2146169750509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2041200, while the sum is 53.

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