Base | Representation |
---|---|
bin | 10100100010111100… |
… | …01011110010011001 |
3 | 1001110201220200001122 |
4 | 22101132023302121 |
5 | 140042304343023 |
6 | 5022314455025 |
7 | 540230033663 |
oct | 122136136231 |
9 | 31421820048 |
10 | 11030543513 |
11 | 47504aa670 |
12 | 217a134475 |
13 | 106a35cb32 |
14 | 768d81533 |
15 | 4485c42c8 |
hex | 29178bc99 |
11030543513 has 8 divisors (see below), whose sum is σ = 12034205760. Its totient is φ = 10027028880.
The previous prime is 11030543467. The next prime is 11030543519. The reversal of 11030543513 is 31534503011.
11030543513 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 de Polignac number, because none of the positive numbers 2k-11030543513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11030543519) 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, 169631 + ... + 225467.
It is an arithmetic number, because the mean of its divisors is an integer number (1504275720).
Almost surely, 211030543513 is an apocalyptic number.
It is an amenable number.
11030543513 is a deficient number, since it is larger than the sum of its proper divisors (1003662247).
11030543513 is a wasteful number, since it uses less digits than its factorization.
11030543513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73807.
The product of its (nonzero) digits is 2700, while the sum is 26.
The spelling of 11030543513 in words is "eleven billion, thirty million, five hundred forty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •