Base | Representation |
---|---|
bin | 1010001000101011111111… |
… | …1000011100010001111100 |
3 | 1110110101112220202120000200 |
4 | 2202022333320130101330 |
5 | 2430042124242104410 |
6 | 35411352245523500 |
7 | 2230103511341064 |
oct | 242127770342174 |
9 | 43411486676020 |
10 | 11144364409980 |
11 | 36073311a394a |
12 | 12bba29113590 |
13 | 62aba8267859 |
14 | 2a75666963a4 |
15 | 144d556343c0 |
hex | a22bfe1c47c |
11144364409980 has 72 divisors (see below), whose sum is σ = 33830516402592. Its totient is φ = 2969549686656.
The previous prime is 11144364409967. The next prime is 11144364409987. The reversal of 11144364409980 is 8990446344111.
It is a happy number.
11144364409980 is a `hidden beast` number, since 1 + 1 + 1 + 4 + 4 + 36 + 440 + 99 + 80 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11144364409987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23523379 + ... + 23992458.
Almost surely, 211144364409980 is an apocalyptic number.
11144364409980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11144364409980 is an abundant number, since it is smaller than the sum of its proper divisors (22686151992612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11144364409980 is a wasteful number, since it uses less digits than its factorization.
11144364409980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47517155 (or 47517150 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 54.
The spelling of 11144364409980 in words is "eleven trillion, one hundred forty-four billion, three hundred sixty-four million, four hundred nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •