Base | Representation |
---|---|
bin | 1010011110100111100010… |
… | …0101111100100011001100 |
3 | 1111210102001001020001002210 |
4 | 2213221320211330203030 |
5 | 3002230231112014012 |
6 | 40300422035350420 |
7 | 2266242141643212 |
oct | 247517045744314 |
9 | 44712031201083 |
10 | 11521125501132 |
11 | 3742099a99055 |
12 | 1360a55752410 |
13 | 65758c188750 |
14 | 2bb8a833acb2 |
15 | 14ea56c7a23c |
hex | a7a7897c8cc |
11521125501132 has 48 divisors (see below), whose sum is σ = 29076942067040. Its totient is φ = 3529481499648.
The previous prime is 11521125501121. The next prime is 11521125501283. The reversal of 11521125501132 is 23110552112511.
It is a self number, because there is not a number n which added to its sum of digits gives 11521125501132.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 161216173 + ... + 161287620.
Almost surely, 211521125501132 is an apocalyptic number.
11521125501132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11521125501132 is an abundant number, since it is smaller than the sum of its proper divisors (17555816565908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11521125501132 is a wasteful number, since it uses less digits than its factorization.
11521125501132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322504042 (or 322504040 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 30.
Adding to 11521125501132 its reverse (23110552112511), we get a palindrome (34631677613643).
The spelling of 11521125501132 in words is "eleven trillion, five hundred twenty-one billion, one hundred twenty-five million, five hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •