Base | Representation |
---|---|
bin | 10101011100001010… |
… | …01010000101110111 |
3 | 1002201012002010002012 |
4 | 22232011022011313 |
5 | 142033143202411 |
6 | 5142102234435 |
7 | 555145552565 |
oct | 125605120567 |
9 | 32635063065 |
10 | 11510522231 |
11 | 497743179a |
12 | 2292a25a1b |
13 | 1115924c00 |
14 | 7b2a04a35 |
15 | 4757d518b |
hex | 2ae14a177 |
11510522231 has 24 divisors (see below), whose sum is σ = 13213156320. Its totient is φ = 9988033536.
The previous prime is 11510522203. The next prime is 11510522249. The reversal of 11510522231 is 13222501511.
11510522231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11510522231 - 222 = 11506327927 is a prime.
It is a super-2 number, since 2×115105222312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11510522197 and 11510522206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11510522281) 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 23 ways as a sum of consecutive naturals, for example, 3052115 + ... + 3055883.
It is an arithmetic number, because the mean of its divisors is an integer number (550548180).
Almost surely, 211510522231 is an apocalyptic number.
11510522231 is a deficient number, since it is larger than the sum of its proper divisors (1702634089).
11510522231 is a wasteful number, since it uses less digits than its factorization.
11510522231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4875 (or 4862 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 23.
The spelling of 11510522231 in words is "eleven billion, five hundred ten million, five hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •