Search a number
-
+
11100056010 = 235370001867
BaseRepresentation
bin10100101011001110…
…10110100111001010
31001122120201021021120
422111213112213022
5140213103243020
65033240420110
7542032630221
oct122547264712
931576637246
1011100056010
11478676840a
122199477636
13107b88a7a4
147742b7cb8
1544e755740
hex2959d69ca

11100056010 has 16 divisors (see below), whose sum is σ = 26640134496. Its totient is φ = 2960014928.

The previous prime is 11100055997. The next prime is 11100056017. The reversal of 11100056010 is 1065000111.

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

It is a Harshad number since it is a multiple of its sum of digits (15).

It is a Curzon number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 185000904 + ... + 185000963.

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

Almost surely, 211100056010 is an apocalyptic number.

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

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

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

11100056010 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 370001877.

The product of its (nonzero) digits is 30, while the sum is 15.

Adding to 11100056010 its reverse (1065000111), we get a palindrome (12165056121).

The spelling of 11100056010 in words is "eleven billion, one hundred million, fifty-six thousand, ten".

Divisors: 1 2 3 5 6 10 15 30 370001867 740003734 1110005601 1850009335 2220011202 3700018670 5550028005 11100056010