Base | Representation |
---|---|
bin | 10100110000000111… |
… | …10110001000000000 |
3 | 1001202102220111000000 |
4 | 22120003312020000 |
5 | 140304104021202 |
6 | 5041304000000 |
7 | 543041420331 |
oct | 123003661000 |
9 | 31672814000 |
10 | 11141079552 |
11 | 47a7937a69 |
12 | 21ab160000 |
13 | 1087222185 |
14 | 779916288 |
15 | 45315a91c |
hex | 2980f6200 |
11141079552 has 280 divisors, whose sum is σ = 35154290160. Its totient is φ = 3515996160.
The previous prime is 11141079511. The next prime is 11141079601. The reversal of 11141079552 is 25597014111.
11141079552 is a `hidden beast` number, since 11 + 14 + 10 + 79 + 552 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 7090927 + ... + 7092497.
Almost surely, 211141079552 is an apocalyptic number.
11141079552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11141079552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17577145080).
11141079552 is an abundant number, since it is smaller than the sum of its proper divisors (24013210608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11141079552 is an frugal number, since it uses more digits than its factorization.
11141079552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1626 (or 1595 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 36.
The spelling of 11141079552 in words is "eleven billion, one hundred forty-one million, seventy-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •