Search a number
-
+
11011020001 = 569122315823
BaseRepresentation
bin10100100000100111…
…01101010011100001
31001102101011202211121
422100103231103201
5140022310120001
65020340212241
7536602061062
oct122023552341
931371152747
1011011020001
114740485333
12217369a081
1310662b5567
1476653c569
15446a196a1
hex2904ed4e1

11011020001 has 8 divisors (see below), whose sum is σ = 11040088320. Its totient is φ = 10981986912.

The previous prime is 11011019959. The next prime is 11011020073. The reversal of 11011020001 is 10002011011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 11011020001 - 215 = 11010987233 is a prime.

It is a super-2 number, since 2×110110200012 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

Almost surely, 211011020001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17615.

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

Adding to 11011020001 its reverse (10002011011), we get a palindrome (21013031012).

The spelling of 11011020001 in words is "eleven billion, eleven million, twenty thousand, one".

Divisors: 1 569 1223 15823 695887 9003287 19351529 11011020001