Search a number
-
+
41101410131 is a prime number
BaseRepresentation
bin100110010001110101…
…011011111101010011
310221002102112222011022
4212101311123331103
51133133430111011
630514241510055
72653350136025
oct462165337523
9127072488138
1041101410131
1116481746851
127b7094232b
133b50308032
141dbc996015
15110854a8db
hex991d5bf53

41101410131 has 2 divisors, whose sum is σ = 41101410132. Its totient is φ = 41101410130.

The previous prime is 41101410101. The next prime is 41101410169. The reversal of 41101410131 is 13101410114.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 41101410131 - 214 = 41101393747 is a prime.

It is a super-2 number, since 2×411014101312 (a number of 22 digits) contains 22 as substring.

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

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

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

Almost surely, 241101410131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 17.

Subtracting from 41101410131 its sum of digits (17), we obtain a palindrome (41101410114).

Adding to 41101410131 its reverse (13101410114), we get a palindrome (54202820245).

The spelling of 41101410131 in words is "forty-one billion, one hundred one million, four hundred ten thousand, one hundred thirty-one".