Search a number
-
+
11112011210 = 251111201121
BaseRepresentation
bin10100101100101001…
…11101010111001010
31001200102012122201202
422112110331113022
5140224133324320
65034344544202
7542236352066
oct122624752712
931612178652
1011112011210
114792493543
1221a1482062
1310811b5281
14775b0aaa6
15450817b75
hex29653d5ca

11112011210 has 8 divisors (see below), whose sum is σ = 20001620196. Its totient is φ = 4444804480.

The previous prime is 11112011201. The next prime is 11112011231. The reversal of 11112011210 is 1211021111.

It can be written as a sum of positive squares in 2 ways, for example, as 10136261041 + 975750169 = 100679^2 + 31237^2 .

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 = 11112011191 and 11112011200.

It is an unprimeable number.

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

Almost surely, 211112011210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1111201128.

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

Adding to 11112011210 its reverse (1211021111), we get a palindrome (12323032321).

Subtracting from 11112011210 its reverse (1211021111), we obtain a palindrome (9900990099).

The spelling of 11112011210 in words is "eleven billion, one hundred twelve million, eleven thousand, two hundred ten".

Divisors: 1 2 5 10 1111201121 2222402242 5556005605 11112011210