Base | Representation |
---|---|
bin | 1010011111000100100100… |
… | …1100011101110000010000 |
3 | 1111211011011021101010121020 |
4 | 2213301021030131300100 |
5 | 3002342212034224312 |
6 | 40304151323355440 |
7 | 2266636251011061 |
oct | 247611114356020 |
9 | 44734137333536 |
10 | 11528920226832 |
11 | 3745429a00918 |
12 | 1362470082b80 |
13 | 658232018988 |
14 | 2bc00764c568 |
15 | 14ed6122878c |
hex | a7c4931dc10 |
11528920226832 has 20 divisors (see below), whose sum is σ = 29783043919440. Its totient is φ = 3842973408928.
The previous prime is 11528920226821. The next prime is 11528920226839. The reversal of 11528920226832 is 23862202982511.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (11528920226839) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 120092918982 + ... + 120092919077.
It is an arithmetic number, because the mean of its divisors is an integer number (1489152195972).
Almost surely, 211528920226832 is an apocalyptic number.
11528920226832 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11528920226832 is an abundant number, since it is smaller than the sum of its proper divisors (18254123692608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11528920226832 is a wasteful number, since it uses less digits than its factorization.
11528920226832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240185838070 (or 240185838064 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 51.
The spelling of 11528920226832 in words is "eleven trillion, five hundred twenty-eight billion, nine hundred twenty million, two hundred twenty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •