Base | Representation |
---|---|
bin | 10101000011011111… |
… | …00001100010110011 |
3 | 1002011202120112121201 |
4 | 22201233201202303 |
5 | 141122200241111 |
6 | 5105345432031 |
7 | 550053242005 |
oct | 124157414263 |
9 | 32152515551 |
10 | 11303524531 |
11 | 48805aa312 |
12 | 223563b617 |
13 | 10b1a8a770 |
14 | 793320375 |
15 | 4625476c1 |
hex | 2a1be18b3 |
11303524531 has 16 divisors (see below), whose sum is σ = 12660323200. Its totient is φ = 10023481728.
The previous prime is 11303524523. The next prime is 11303524579. The reversal of 11303524531 is 13542530311.
It is a happy number.
11303524531 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 11303524531 - 23 = 11303524523 is a prime.
It is a super-2 number, since 2×113035245312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11303524531.
It is not an unprimeable number, because it can be changed into a prime (11303524591) 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 15 ways as a sum of consecutive naturals, for example, 110736 + ... + 186733.
It is an arithmetic number, because the mean of its divisors is an integer number (791270200).
Almost surely, 211303524531 is an apocalyptic number.
11303524531 is a deficient number, since it is larger than the sum of its proper divisors (1356798669).
11303524531 is a wasteful number, since it uses less digits than its factorization.
11303524531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297598.
The product of its (nonzero) digits is 5400, while the sum is 28.
The spelling of 11303524531 in words is "eleven billion, three hundred three million, five hundred twenty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •