Base | Representation |
---|---|
bin | 10101011101011100… |
… | …10010011000100101 |
3 | 1002201221100220000201 |
4 | 22232232102120211 |
5 | 142043423212401 |
6 | 5143125310501 |
7 | 555336316606 |
oct | 125656223045 |
9 | 32657326021 |
10 | 11521304101 |
11 | 498252632a |
12 | 2296565431 |
13 | 1117c2b608 |
14 | 7b420ddad |
15 | 476714b01 |
hex | 2aeb92625 |
11521304101 has 8 divisors (see below), whose sum is σ = 11933558784. Its totient is φ = 11111586960.
The previous prime is 11521304099. The next prime is 11521304117. The reversal of 11521304101 is 10140312511.
11521304101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11521304101 - 21 = 11521304099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11521304191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 625141 + ... + 643306.
It is an arithmetic number, because the mean of its divisors is an integer number (1491694848).
Almost surely, 211521304101 is an apocalyptic number.
It is an amenable number.
11521304101 is a deficient number, since it is larger than the sum of its proper divisors (412254683).
11521304101 is a wasteful number, since it uses less digits than its factorization.
11521304101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268771.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 11521304101 its reverse (10140312511), we get a palindrome (21661616612).
The spelling of 11521304101 in words is "eleven billion, five hundred twenty-one million, three hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •