Search a number
-
+
11002311020 = 225550115551
BaseRepresentation
bin10100011111100100…
…11111000101101100
31001101202210022100202
422033302133011230
5140013042423040
65015425413032
7536435046341
oct121762370554
931352708322
1011002311020
114736577128
12217079a178
13106455650c
147653127c8
15445d99015
hex28fc9f16c

11002311020 has 12 divisors (see below), whose sum is σ = 23104853184. Its totient is φ = 4400924400.

The previous prime is 11002311013. The next prime is 11002311139. The reversal of 11002311020 is 2011320011.

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

It is an unprimeable number.

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

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

It is an arithmetic number, because the mean of its divisors is an integer number (1925404432).

Almost surely, 211002311020 is an apocalyptic number.

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

It is an amenable number.

11002311020 is an abundant number, since it is smaller than the sum of its proper divisors (12102542164).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 550115560 (or 550115558 counting only the distinct ones).

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

Adding to 11002311020 its reverse (2011320011), we get a palindrome (13013631031).

The spelling of 11002311020 in words is "eleven billion, two million, three hundred eleven thousand, twenty".

Divisors: 1 2 4 5 10 20 550115551 1100231102 2200462204 2750577755 5501155510 11002311020