Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …1010011011000101000010 |
3 | 1110000121102011221021200112 |
4 | 2200120031122123011002 |
5 | 2421032213421041002 |
6 | 35235010055551322 |
7 | 2215151256523655 |
oct | 240301532330502 |
9 | 43017364837615 |
10 | 11021111112002 |
11 | 356a0329a2912 |
12 | 129bb6b98b542 |
13 | 61c3950703c4 |
14 | 2a15d324d89c |
15 | 141a3ec53852 |
hex | a060d69b142 |
11021111112002 has 8 divisors (see below), whose sum is σ = 16534668621456. Its totient is φ = 5509554904852.
The previous prime is 11021111111981. The next prime is 11021111112019. The reversal of 11021111112002 is 20021111112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500311808 + ... + 500333835.
It is an arithmetic number, because the mean of its divisors is an integer number (2066833577682).
Almost surely, 211021111112002 is an apocalyptic number.
11021111112002 is a deficient number, since it is larger than the sum of its proper divisors (5513557509454).
11021111112002 is a wasteful number, since it uses less digits than its factorization.
11021111112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000651152.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11021111112002 its reverse (20021111112011), we get a palindrome (31042222224013).
Subtracting 11021111112002 from its reverse (20021111112011), we obtain a palindrome (9000000000009).
The spelling of 11021111112002 in words is "eleven trillion, twenty-one billion, one hundred eleven million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •