Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101110101001111101101 |
3 | 1110101001122222220201211210 |
4 | 2201310103231311033231 |
5 | 2424142230241023041 |
6 | 35352242531505033 |
7 | 2225251664614005 |
oct | 241642355651755 |
9 | 43331588821753 |
10 | 11120001111021 |
11 | 35a7a69802830 |
12 | 12b7169a58179 |
13 | 6287c490a01a |
14 | 2a62d4acb005 |
15 | 1443cb7ce016 |
hex | a1d13b753ed |
11120001111021 has 64 divisors (see below), whose sum is σ = 17200545094656. Its totient is φ = 6315365760000.
The previous prime is 11120001111007. The next prime is 11120001111067. The reversal of 11120001111021 is 12011110002111.
It is not a de Polignac number, because 11120001111021 - 211 = 11120001108973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11120001110988 and 11120001111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120001111221) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 427630006 + ... + 427656008.
It is an arithmetic number, because the mean of its divisors is an integer number (268758517104).
Almost surely, 211120001111021 is an apocalyptic number.
11120001111021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11120001111021 is a deficient number, since it is larger than the sum of its proper divisors (6080543983635).
11120001111021 is a wasteful number, since it uses less digits than its factorization.
11120001111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29322.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11120001111021 its reverse (12011110002111), we get a palindrome (23131111113132).
The spelling of 11120001111021 in words is "eleven trillion, one hundred twenty billion, one million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •