Base | Representation |
---|---|
bin | 1010001101010101001100… |
… | …1001000110101100101001 |
3 | 1110202000110220222000002020 |
4 | 2203111103021012230221 |
5 | 2432344021434040410 |
6 | 35512144544455053 |
7 | 2235626522403102 |
oct | 243252311065451 |
9 | 43660426860066 |
10 | 11224144440105 |
11 | 3638150a18343 |
12 | 131339331a489 |
13 | 63558094287c |
14 | 2ab3741313a9 |
15 | 146e74651a70 |
hex | a3553246b29 |
11224144440105 has 8 divisors (see below), whose sum is σ = 17958631104192. Its totient is φ = 5986210368048.
The previous prime is 11224144440077. The next prime is 11224144440169. The reversal of 11224144440105 is 50104444142211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11224144440105 - 224 = 11224127662889 is a prime.
It is a super-2 number, since 2×112241444401052 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 374138147989 + ... + 374138148018.
It is an arithmetic number, because the mean of its divisors is an integer number (2244828888024).
Almost surely, 211224144440105 is an apocalyptic number.
11224144440105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11224144440105 is a deficient number, since it is larger than the sum of its proper divisors (6734486664087).
11224144440105 is an equidigital number, since it uses as much as digits as its factorization.
11224144440105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 748276296015.
The product of its (nonzero) digits is 20480, while the sum is 33.
Adding to 11224144440105 its reverse (50104444142211), we get a palindrome (61328588582316).
The spelling of 11224144440105 in words is "eleven trillion, two hundred twenty-four billion, one hundred forty-four million, four hundred forty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •