Search a number
-
+
109911000010 = 2571570157143
BaseRepresentation
bin110011001011100110…
…1001100001111001010
3101111200212221022100011
41212113031030033022
53300044204000020
6122254210102134
710640461041160
oct1462715141712
9344625838304
10109911000010
11426819920a9
1219374b7a94a
13a497c381a6
145469457230
152cd43b735a
hex199734c3ca

109911000010 has 16 divisors (see below), whose sum is σ = 226102628736. Its totient is φ = 37683771408.

The previous prime is 109910999993. The next prime is 109911000011. The reversal of 109911000010 is 10000119901.

It is not an unprimeable number, because it can be changed into a prime (109911000011) 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, 785078502 + ... + 785078641.

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

Almost surely, 2109911000010 is an apocalyptic number.

109911000010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

109911000010 is an abundant number, since it is smaller than the sum of its proper divisors (116191628726).

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

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

The sum of its prime factors is 1570157157.

The product of its (nonzero) digits is 81, while the sum is 22.

Adding to 109911000010 its reverse (10000119901), we get a palindrome (119911119911).

It can be divided in two parts, 109 and 911000010, that added together give a palindrome (911000119).

The spelling of 109911000010 in words is "one hundred nine billion, nine hundred eleven million, ten", and thus it is an aban number.

Divisors: 1 2 5 7 10 14 35 70 1570157143 3140314286 7850785715 10991100001 15701571430 21982200002 54955500005 109911000010