Search a number
-
+
11130003110 = 251113000311
BaseRepresentation
bin10100101110110011…
…00101111010100110
31001201200001201222102
422113121211322212
5140243240044420
65040230332102
7542545315442
oct122731457246
931650051872
1011130003110
1147a1662086
1221a74ba032
131084b44675
14778271822
154521bda75
hex297665ea6

11130003110 has 8 divisors (see below), whose sum is σ = 20034005616. Its totient is φ = 4452001240.

The previous prime is 11130003077. The next prime is 11130003167. The reversal of 11130003110 is 1130003111.

It is a happy number.

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

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 556500146 + ... + 556500165.

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

Almost surely, 211130003110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1113000318.

The product of its (nonzero) digits is 9, while the sum is 11.

Adding to 11130003110 its reverse (1130003111), we get a palindrome (12260006221).

Subtracting from 11130003110 its reverse (1130003111), we obtain a palindrome (9999999999).

The spelling of 11130003110 in words is "eleven billion, one hundred thirty million, three thousand, one hundred ten".

Divisors: 1 2 5 10 1113000311 2226000622 5565001555 11130003110