Search a number
-
+
11011002010 = 251101100201
BaseRepresentation
bin10100100000100111…
…01000111010011010
31001102101010212011021
422100103220322122
5140022304031020
65020335553054
7536601654451
oct122023507232
931371125137
1011011002010
114740472868
12217368b78a
1310662aa308
14766535b98
15446a141aa
hex2904e8e9a

11011002010 has 8 divisors (see below), whose sum is σ = 19819803636. Its totient is φ = 4404400800.

The previous prime is 11011001957. The next prime is 11011002019. The reversal of 11011002010 is 1020011011.

It can be written as a sum of positive squares in 2 ways, for example, as 10838683881 + 172318129 = 104109^2 + 13127^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 = 11011001984 and 11011002002.

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

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

Almost surely, 211011002010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1101100208.

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

Adding to 11011002010 its reverse (1020011011), we get a palindrome (12031013021).

Subtracting from 11011002010 its reverse (1020011011), we obtain a palindrome (9990990999).

The spelling of 11011002010 in words is "eleven billion, eleven million, two thousand, ten".

Divisors: 1 2 5 10 1101100201 2202200402 5505501005 11011002010