Search a number
-
+
41405911369 is a prime number
BaseRepresentation
bin100110100011111111…
…000001000101001001
310221212122112020022221
4212203333001011021
51134244403130434
631004400214041
72664035303524
oct464377010511
9127778466287
1041405911369
1116618615069
12803690a321
133b9b420894
14200b1bbbbb
1511251482b4
hex9a3fc1149

41405911369 has 2 divisors, whose sum is σ = 41405911370. Its totient is φ = 41405911368.

The previous prime is 41405911333. The next prime is 41405911381. The reversal of 41405911369 is 96311950414.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 36667654144 + 4738257225 = 191488^2 + 68835^2 .

It is a cyclic number.

It is not a de Polignac number, because 41405911369 - 27 = 41405911241 is a prime.

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

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

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

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

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

Almost surely, 241405911369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 116640, while the sum is 43.

The spelling of 41405911369 in words is "forty-one billion, four hundred five million, nine hundred eleven thousand, three hundred sixty-nine".