Search a number
-
+
41101251293 is a prime number
BaseRepresentation
bin100110010001110100…
…110101001011011101
310221002102020220021102
4212101310311023131
51133133410020133
630514234242445
72653345604654
oct462164651335
9127072226242
1041101251293
1116481648483
127b70886425
133b5028094b
141dbc95419b
1511085187e8
hex991d352dd

41101251293 has 2 divisors, whose sum is σ = 41101251294. Its totient is φ = 41101251292.

The previous prime is 41101251239. The next prime is 41101251299. The reversal of 41101251293 is 39215210114.

Together with previous prime (41101251239) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 36201531289 + 4899720004 = 190267^2 + 69998^2 .

It is a cyclic number.

It is not a de Polignac number, because 41101251293 - 222 = 41097056989 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 (41101251299) by changing a digit.

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

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

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

Almost surely, 241101251293 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2160, while the sum is 29.

The spelling of 41101251293 in words is "forty-one billion, one hundred one million, two hundred fifty-one thousand, two hundred ninety-three".