Search a number
-
+
41715642131 = 52181239857
BaseRepresentation
bin100110110110011100…
…100010111100010011
310222200020100012001122
4212312130202330103
51140413201022011
631055222552455
73004516051622
oct466634427423
9128606305048
1041715642131
11167674353a9
12810259872b
133c1a647817
14203a3a56b9
15114242a3db
hex9b6722f13

41715642131 has 8 divisors (see below), whose sum is σ = 41805096624. Its totient is φ = 41626224640.

The previous prime is 41715642113. The next prime is 41715642229. The reversal of 41715642131 is 13124651714.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 41715642131 - 214 = 41715625747 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (41715642431) 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 in 7 ways as a sum of consecutive naturals, for example, 4227155 + ... + 4237011.

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

Almost surely, 241715642131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 18501.

The product of its digits is 20160, while the sum is 35.

The spelling of 41715642131 in words is "forty-one billion, seven hundred fifteen million, six hundred forty-two thousand, one hundred thirty-one".

Divisors: 1 521 8123 9857 4232083 5135497 80068411 41715642131