Base | Representation |
---|---|
bin | 1010000110101100110010… |
… | …1101111011110100011101 |
3 | 1110100010102100001212210012 |
4 | 2201223030231323310131 |
5 | 2424012212311133041 |
6 | 35343544205053005 |
7 | 2224454415665432 |
oct | 241531455736435 |
9 | 43303370055705 |
10 | 11110220021021 |
11 | 35a38aa617080 |
12 | 12b529a257165 |
13 | 6278c63980c4 |
14 | 2a5a47a6db89 |
15 | 144007c633eb |
hex | a1accb7bd1d |
11110220021021 has 64 divisors (see below), whose sum is σ = 12971852006400. Its totient is φ = 9410051750400.
The previous prime is 11110220020973. The next prime is 11110220021041. The reversal of 11110220021021 is 12012002201111.
It is a de Polignac number, because none of the positive numbers 2k-11110220021021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11110220020987 and 11110220021005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110220021041) 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, 1412252330 + ... + 1412260196.
It is an arithmetic number, because the mean of its divisors is an integer number (202685187600).
Almost surely, 211110220021021 is an apocalyptic number.
11110220021021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11110220021021 is a deficient number, since it is larger than the sum of its proper divisors (1861631985379).
11110220021021 is a wasteful number, since it uses less digits than its factorization.
11110220021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8490.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11110220021021 its reverse (12012002201111), we get a palindrome (23122222222132).
The spelling of 11110220021021 in words is "eleven trillion, one hundred ten billion, two hundred twenty million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •