Search a number
-
+
121053433203401 is a prime number
BaseRepresentation
bin11011100001100011110010…
…111000101000101011001001
3120212121121001220012102201212
4123201203302320220223021
5111331314412400002101
61105243102434222505
734332551631523256
oct3341436270505311
9525547056172655
10121053433203401
1135631522206736
12116b0b71a24a35
13527139c81511a
1421c7035b7842d
15dedd26d771bb
hex6e18f2e28ac9

121053433203401 has 2 divisors, whose sum is σ = 121053433203402. Its totient is φ = 121053433203400.

The previous prime is 121053433203383. The next prime is 121053433203523. The reversal of 121053433203401 is 104302334350121.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 119215716774025 + 1837716429376 = 10918595^2 + 1355624^2 .

It is a cyclic number.

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

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

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

Almost surely, 2121053433203401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 32.

Adding to 121053433203401 its reverse (104302334350121), we get a palindrome (225355767553522).

The spelling of 121053433203401 in words is "one hundred twenty-one trillion, fifty-three billion, four hundred thirty-three million, two hundred three thousand, four hundred one".