Base | Representation |
---|---|
bin | 10100110001000100… |
… | …11010010100110000 |
3 | 1001202222222120012200 |
4 | 22120202122110300 |
5 | 140313131422034 |
6 | 5042151423200 |
7 | 543166501551 |
oct | 123042322460 |
9 | 31688876180 |
10 | 11149092144 |
11 | 480140aa43 |
12 | 21b1984b00 |
13 | 1088a99258 |
14 | 77aa00328 |
15 | 453bdea99 |
hex | 29889a530 |
11149092144 has 120 divisors (see below), whose sum is σ = 31511472720. Its totient is φ = 3679658496.
The previous prime is 11149092121. The next prime is 11149092179. The reversal of 11149092144 is 44129094111.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 11149092099 and 11149092108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13070022 + ... + 13070874.
It is an arithmetic number, because the mean of its divisors is an integer number (262595606).
Almost surely, 211149092144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11149092144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15755736360).
11149092144 is an abundant number, since it is smaller than the sum of its proper divisors (20362380576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11149092144 is a wasteful number, since it uses less digits than its factorization.
11149092144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1659 (or 1650 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 36.
The spelling of 11149092144 in words is "eleven billion, one hundred forty-nine million, ninety-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •