Search a number
-
+
11113311010 = 251111331101
BaseRepresentation
bin10100101100110011…
…11010101100100010
31001200111122200201111
422112121322230202
5140230001423020
65034432453534
7542253404434
oct122631725442
931614580644
1011113311010
1147931a105a
1221a19aa2aa
13108154ba99
14775d68654
154509c2d5a
hex29667ab22

11113311010 has 8 divisors (see below), whose sum is σ = 20003959836. Its totient is φ = 4445324400.

The previous prime is 11113310987. The next prime is 11113311019. The reversal of 11113311010 is 1011331111.

11113311010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 10849930569 + 263380441 = 104163^2 + 16229^2 .

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 555665541 + ... + 555665560.

Almost surely, 211113311010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1111331108.

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

Adding to 11113311010 its reverse (1011331111), we get a palindrome (12124642121).

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

Divisors: 1 2 5 10 1111331101 2222662202 5556655505 11113311010