Base | Representation |
---|---|
bin | 10100110111010001… |
… | …11000011100010101 |
3 | 1001220121212212001002 |
4 | 22123220320130111 |
5 | 140414441320041 |
6 | 5051250513045 |
7 | 544400643410 |
oct | 123350703425 |
9 | 31817785032 |
10 | 11201120021 |
11 | 4828816293 |
12 | 2207295785 |
13 | 10967b4690 |
14 | 7838a4b77 |
15 | 45856a59b |
hex | 29ba38715 |
11201120021 has 64 divisors (see below), whose sum is σ = 14852597760. Its totient is φ = 8196526080.
The previous prime is 11201120003. The next prime is 11201120113. The reversal of 11201120021 is 12002110211.
11201120021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11201120021 - 26 = 11201119957 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11201119984 and 11201120011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201120321) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 30520580 + ... + 30520946.
It is an arithmetic number, because the mean of its divisors is an integer number (232071840).
Almost surely, 211201120021 is an apocalyptic number.
It is an amenable number.
11201120021 is a deficient number, since it is larger than the sum of its proper divisors (3651477739).
11201120021 is a wasteful number, since it uses less digits than its factorization.
11201120021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11201120021 its reverse (12002110211), we get a palindrome (23203230232).
The spelling of 11201120021 in words is "eleven billion, two hundred one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •