Search a number
-
+
4109559013 = 72118213389
BaseRepresentation
bin1111010011110010…
…1110010011100101
3101121101212020011101
43310330232103211
531404021342023
61515442040101
7203560450420
oct36474562345
911541766141
104109559013
11181981456a
12968349031
13506531131
142adb129b7
15190bb71ad
hexf4f2e4e5

4109559013 has 16 divisors (see below), whose sum is σ = 4726039680. Its totient is φ = 3500481600.

The previous prime is 4109559011. The next prime is 4109559019. The reversal of 4109559013 is 3109559014.

It is a happy number.

It is not a de Polignac number, because 4109559013 - 21 = 4109559011 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 24109559013 is an apocalyptic number.

It is an amenable number.

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

4109559013 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 4428.

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

The square root of 4109559013 is about 64105.8422688603. The cubic root of 4109559013 is about 1601.7635519480.

Subtracting from 4109559013 its reverse (3109559014), we obtain a palindrome (999999999).

The spelling of 4109559013 in words is "four billion, one hundred nine million, five hundred fifty-nine thousand, thirteen".

Divisors: 1 7 211 821 1477 3389 5747 23723 173231 715079 1212617 2782369 5005553 19476583 587079859 4109559013