Search a number
-
+
11012212010 = 251240188801
BaseRepresentation
bin10100100000110000…
…10000010100101010
31001102110102022222002
422100120100110222
5140023111241020
65020421531002
7536615154242
oct122030202452
931373368862
1011012212010
114741119968
122173b73a62
131066611ca7
1476676cb22
15446ba2975
hex29061052a

11012212010 has 16 divisors (see below), whose sum is σ = 19823803272. Its totient is φ = 4404480000.

The previous prime is 11012212007. The next prime is 11012212063. The reversal of 11012212010 is 1021221011.

It can be written as a sum of positive squares in 4 ways, for example, as 4533732889 + 6478479121 = 67333^2 + 80489^2 .

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

It is an unprimeable number.

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

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

Almost surely, 211012212010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 101209.

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

Adding to 11012212010 its reverse (1021221011), we get a palindrome (12033433021).

Subtracting from 11012212010 its reverse (1021221011), we obtain a palindrome (9990990999).

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

Divisors: 1 2 5 10 12401 24802 62005 88801 124010 177602 444005 888010 1101221201 2202442402 5506106005 11012212010