Search a number
-
+
121376170233509 is a prime number
BaseRepresentation
bin11011100110010000010111…
…100000101100111010100101
3120220202110002222212021012012
4123212100113200230322211
5111402111344034433014
61110051235353004005
734365065435154302
oct3346202740547245
9526673088767165
10121376170233509
1135746387910204
12117436219b3605
13529595409bba9
1421d88d08b40a9
15e074156edc3e
hex6e641782cea5

121376170233509 has 2 divisors, whose sum is σ = 121376170233510. Its totient is φ = 121376170233508.

The previous prime is 121376170233377. The next prime is 121376170233551. The reversal of 121376170233509 is 905332071673121.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97227054302884 + 24149115930625 = 9860378^2 + 4914175^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-121376170233509 is a prime.

It is a Sophie Germain 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 (121376170233589) by changing a digit.

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

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

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

Almost surely, 2121376170233509 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 121376170233509 in words is "one hundred twenty-one trillion, three hundred seventy-six billion, one hundred seventy million, two hundred thirty-three thousand, five hundred nine".