Search a number
-
+
41510933641 is a prime number
BaseRepresentation
bin100110101010001111…
…101001010010001001
310222010222010220210201
4212222033221102021
51140003244334031
631023031212201
72666452054102
oct465217512211
9128128126721
1041510933641
1116671926931
128065b17061
133bb7102338
14201b1193a9
15112e490d61
hex9aa3e9489

41510933641 has 2 divisors, whose sum is σ = 41510933642. Its totient is φ = 41510933640.

The previous prime is 41510933599. The next prime is 41510933663. The reversal of 41510933641 is 14633901514.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 39378433600 + 2132500041 = 198440^2 + 46179^2 .

It is a cyclic number.

It is not a de Polignac number, because 41510933641 - 211 = 41510931593 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 41510933641.

It is not a weakly prime, because it can be changed into another prime (41510933041) 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, 20755466820 + 20755466821.

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

Almost surely, 241510933641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 37.

The spelling of 41510933641 in words is "forty-one billion, five hundred ten million, nine hundred thirty-three thousand, six hundred forty-one".