Search a number
-
+
104033320121 is a prime number
BaseRepresentation
bin110000011100011011…
…1100111110010111001
3100221112021001020022102
41200320313213302321
53201030012220441
6115443043033145
710342020426203
oct1407067476271
9327467036272
10104033320121
1140136108215
12181b466b7b5
139a6c2c93b3
14506c9a9773
152a8d39269b
hex1838de7cb9

104033320121 has 2 divisors, whose sum is σ = 104033320122. Its totient is φ = 104033320120.

The previous prime is 104033320109. The next prime is 104033320141. The reversal of 104033320121 is 121023330401.

It is an a-pointer prime, because the next prime (104033320141) can be obtained adding 104033320121 to its sum of digits (20).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 66731805625 + 37301514496 = 258325^2 + 193136^2 .

It is a cyclic number.

It is not a de Polignac number, because 104033320121 - 26 = 104033320057 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 104033320093 and 104033320102.

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

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

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

Almost surely, 2104033320121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 20.

Adding to 104033320121 its reverse (121023330401), we get a palindrome (225056650522).

The spelling of 104033320121 in words is "one hundred four billion, thirty-three million, three hundred twenty thousand, one hundred twenty-one".