Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00011111001100010 |
3 | 1001101200100201102021 |
4 | 22033231203321202 |
5 | 140012230120002 |
6 | 5015342012054 |
7 | 536421061420 |
oct | 121755437142 |
9 | 31350321367 |
10 | 11001020002 |
11 | 4735875175 |
12 | 217027702a |
13 | 10641c39bb |
14 | 765098110 |
15 | 445be1737 |
hex | 28fb63e62 |
11001020002 has 16 divisors (see below), whose sum is σ = 18908660160. Its totient is φ = 4702280688.
The previous prime is 11001019999. The next prime is 11001020021. The reversal of 11001020002 is 20002010011.
It is a Harshad number since it is a multiple of its sum of digits (7).
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 7 ways as a sum of consecutive naturals, for example, 1031353 + ... + 1041964.
It is an arithmetic number, because the mean of its divisors is an integer number (1181791260).
Almost surely, 211001020002 is an apocalyptic number.
11001020002 is a deficient number, since it is larger than the sum of its proper divisors (7907640158).
11001020002 is a wasteful number, since it uses less digits than its factorization.
11001020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2073705.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 11001020002 its reverse (20002010011), we get a palindrome (31003030013).
Subtracting 11001020002 from its reverse (20002010011), we obtain a palindrome (9000990009).
The spelling of 11001020002 in words is "eleven billion, one million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •