Search a number
-
+
11020011010 = 251109993689
BaseRepresentation
bin10100100001101100…
…00000011000000010
31001110000002120011221
422100312000120002
5140032110323020
65021301025254
7540041355661
oct122066003002
931400076157
1011020011010
114745566418
1221766b522a
131068112a98
147677dcdd8
154476e36aa
hex290d80602

11020011010 has 16 divisors (see below), whose sum is σ = 19853926200. Its totient is φ = 4404025216.

The previous prime is 11020011007. The next prime is 11020011019. The reversal of 11020011010 is 1011002011.

It can be written as a sum of positive squares in 4 ways, for example, as 4662021841 + 6357989169 = 68279^2 + 79737^2 .

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

It is not an unprimeable number, because it can be changed into a prime (11020011019) 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, 485755 + ... + 507934.

Almost surely, 211020011010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 994805.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 11020011010 its reverse (1011002011), we get a palindrome (12031013021).

It can be divided in two parts, 1102001 and 1010, that added together give a palindrome (1103011).

The spelling of 11020011010 in words is "eleven billion, twenty million, eleven thousand, ten".

Divisors: 1 2 5 10 1109 2218 5545 11090 993689 1987378 4968445 9936890 1102001101 2204002202 5510005505 11020011010