Search a number
-
+
11103223310 = 251110322331
BaseRepresentation
bin10100101011100110…
…11011111000001110
31001122210200011222222
422111303123320032
5140214411121220
65033432335342
7542101561304
oct122563337016
931583604888
1011103223310
114788531013
12219a544552
13107c42932a
147748a0274
1544eb7de25
hex295cdbe0e

11103223310 has 8 divisors (see below), whose sum is σ = 19985801976. Its totient is φ = 4441289320.

The previous prime is 11103223303. The next prime is 11103223321. The reversal of 11103223310 is 1332230111.

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

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

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, 555161156 + ... + 555161175.

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

Almost surely, 211103223310 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1110322338.

The product of its (nonzero) digits is 108, while the sum is 17.

Adding to 11103223310 its reverse (1332230111), we get a palindrome (12435453421).

The spelling of 11103223310 in words is "eleven billion, one hundred three million, two hundred twenty-three thousand, three hundred ten".

Divisors: 1 2 5 10 1110322331 2220644662 5551611655 11103223310