Search a number
-
+
4104442441133 is a prime number
BaseRepresentation
bin111011101110100011110…
…101010110110110101101
3112112101021122120102202122
4323232203311112312231
51014221344231104013
612421315502002325
7602351624053046
oct73564365266655
915471248512678
104104442441133
111342758834521
125635755763a5
1323a07caaab68
141029283a58cd
1571b75213a08
hex3bba3d56dad

4104442441133 has 2 divisors, whose sum is σ = 4104442441134. Its totient is φ = 4104442441132.

The previous prime is 4104442441097. The next prime is 4104442441153. The reversal of 4104442441133 is 3311442444014.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3988476311689 + 115966129444 = 1997117^2 + 340538^2 .

It is a cyclic number.

It is not a de Polignac number, because 4104442441133 - 26 = 4104442441069 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 24104442441133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 73728, while the sum is 35.

Adding to 4104442441133 its reverse (3311442444014), we get a palindrome (7415884885147).

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