Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …1000001110011110010101 |
3 | 1110022011001011112222200100 |
4 | 2201201223220032132111 |
5 | 2423330300301400041 |
6 | 35335134204204313 |
7 | 2223643243310406 |
oct | 241415350163625 |
9 | 43264034488610 |
10 | 11100001200021 |
11 | 359a536334668 |
12 | 12b3307b39699 |
13 | 626958263a66 |
14 | 2a53588299ad |
15 | 143b0aa7e6b6 |
hex | a186ba0e795 |
11100001200021 has 24 divisors (see below), whose sum is σ = 17182610565120. Its totient is φ = 6886957261536.
The previous prime is 11100001200019. The next prime is 11100001200103. The reversal of 11100001200021 is 12000210000111.
It is a happy number.
It is not a de Polignac number, because 11100001200021 - 21 = 11100001200019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11100001199976 and 11100001200012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100001200721) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 724630101 + ... + 724645418.
It is an arithmetic number, because the mean of its divisors is an integer number (715942106880).
Almost surely, 211100001200021 is an apocalyptic number.
It is an amenable number.
11100001200021 is a deficient number, since it is larger than the sum of its proper divisors (6082609365099).
11100001200021 is a wasteful number, since it uses less digits than its factorization.
11100001200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1449275585 (or 1449275582 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11100001200021 its reverse (12000210000111), we get a palindrome (23100211200132).
The spelling of 11100001200021 in words is "eleven trillion, one hundred billion, one million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •