Base | Representation |
---|---|
bin | 10101000010101000… |
… | …00101100100010000 |
3 | 1002011021001010101110 |
4 | 22201110011210100 |
5 | 141113330111143 |
6 | 5104531333320 |
7 | 546635144451 |
oct | 124124054420 |
9 | 32137033343 |
10 | 11296332048 |
11 | 4877537511 |
12 | 2233151240 |
13 | 10b043ca61 |
14 | 7923ab128 |
15 | 461ac6533 |
hex | 2a1505910 |
11296332048 has 120 divisors (see below), whose sum is σ = 31743429600. Its totient is φ = 3451921920.
The previous prime is 11296332043. The next prime is 11296332049. The reversal of 11296332048 is 84023369211.
It is a junction number, because it is equal to n+sod(n) for n = 11296331997 and 11296332015.
It is not an unprimeable number, because it can be changed into a prime (11296332043) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 869988 + ... + 882876.
It is an arithmetic number, because the mean of its divisors is an integer number (264528580).
Almost surely, 211296332048 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 11296332048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15871714800).
11296332048 is an abundant number, since it is smaller than the sum of its proper divisors (20447097552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11296332048 is a wasteful number, since it uses less digits than its factorization.
11296332048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12981 (or 12944 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 39.
The spelling of 11296332048 in words is "eleven billion, two hundred ninety-six million, three hundred thirty-two thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •