Base | Representation |
---|---|
bin | 10101011101011101… |
… | …01111111011101100 |
3 | 1002201221121001001100 |
4 | 22232232233323230 |
5 | 142043441101012 |
6 | 5143132043100 |
7 | 555340332510 |
oct | 125656577354 |
9 | 32657531040 |
10 | 11521425132 |
11 | 49825a9258 |
12 | 2296603490 |
13 | 1117c71729 |
14 | 7b4242140 |
15 | 47673a8dc |
hex | 2aebafeec |
11521425132 has 72 divisors (see below), whose sum is σ = 33589556000. Its totient is φ = 3261627648.
The previous prime is 11521425131. The next prime is 11521425137. The reversal of 11521425132 is 23152412511.
It is a happy number.
11521425132 is a `hidden beast` number, since 1 + 1 + 5 + 2 + 142 + 513 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 11521425096 and 11521425105.
It is not an unprimeable number, because it can be changed into a prime (11521425131) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 182257 + ... + 237192.
Almost surely, 211521425132 is an apocalyptic number.
11521425132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11521425132 is an abundant number, since it is smaller than the sum of its proper divisors (22068130868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11521425132 is a wasteful number, since it uses less digits than its factorization.
11521425132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419575 (or 419570 counting only the distinct ones).
The product of its digits is 2400, while the sum is 27.
Adding to 11521425132 its reverse (23152412511), we get a palindrome (34673837643).
The spelling of 11521425132 in words is "eleven billion, five hundred twenty-one million, four hundred twenty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •