Base | Representation |
---|---|
bin | 1010000000010111100010… |
… | …1100101010101010010110 |
3 | 1102221201122000011012211202 |
4 | 2200011320230222222112 |
5 | 2420221420133020204 |
6 | 35221553502432502 |
7 | 2213553562641650 |
oct | 240057054525226 |
9 | 42851560135752 |
10 | 11001436220054 |
11 | 3561756a37335 |
12 | 129819a892732 |
13 | 61a57ab449c7 |
14 | 2a06881d56d0 |
15 | 14128c805e1e |
hex | a0178b2aa96 |
11001436220054 has 32 divisors (see below), whose sum is σ = 20209583794176. Its totient is φ = 4384089590400.
The previous prime is 11001436220017. The next prime is 11001436220143. The reversal of 11001436220054 is 45002263410011.
It is a junction number, because it is equal to n+sod(n) for n = 11001436219999 and 11001436220026.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 278441222 + ... + 278480729.
It is an arithmetic number, because the mean of its divisors is an integer number (631549493568).
Almost surely, 211001436220054 is an apocalyptic number.
11001436220054 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11001436220054 is a deficient number, since it is larger than the sum of its proper divisors (9208147574122).
11001436220054 is a wasteful number, since it uses less digits than its factorization.
11001436220054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556922060.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 11001436220054 its reverse (45002263410011), we get a palindrome (56003699630065).
The spelling of 11001436220054 in words is "eleven trillion, one billion, four hundred thirty-six million, two hundred twenty thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •