Search a number
-
+
41102111113 = 75871730159
BaseRepresentation
bin100110010001111000…
…000111000110001001
310221002110212120201121
4212101320013012021
51133134120023423
630514304515241
72653356115510
oct462170070611
9127073776647
1041102111113
1116482085478
127b7101bb21
133b504c210b
141dbcad9677
15110863845d
hex991e07189

41102111113 has 4 divisors (see below), whose sum is σ = 46973841280. Its totient is φ = 35230380948.

The previous prime is 41102111093. The next prime is 41102111177. The reversal of 41102111113 is 31111120114.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 41102111113 - 221 = 41100013961 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (41102111213) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2935865073 + ... + 2935865086.

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

Almost surely, 241102111113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5871730166.

The product of its (nonzero) digits is 24, while the sum is 16.

Adding to 41102111113 its reverse (31111120114), we get a palindrome (72213231227).

Subtracting from 41102111113 its reverse (31111120114), we obtain a palindrome (9990990999).

The spelling of 41102111113 in words is "forty-one billion, one hundred two million, one hundred eleven thousand, one hundred thirteen".

Divisors: 1 7 5871730159 41102111113