Base | Representation |
---|---|
bin | 10100100001010111… |
… | …10000101111001101 |
3 | 1001102211001010101020 |
4 | 22100223300233031 |
5 | 140030413404032 |
6 | 5021123304353 |
7 | 540006502362 |
oct | 122053605715 |
9 | 31384033336 |
10 | 11017325517 |
11 | 4743aa1800 |
12 | 217581b0b9 |
13 | 10676b2633 |
14 | 767300469 |
15 | 447362b2c |
hex | 290af0bcd |
11017325517 has 24 divisors (see below), whose sum is σ = 16152924480. Its totient is φ = 6674553600.
The previous prime is 11017325497. The next prime is 11017325521. The reversal of 11017325517 is 71552371011.
11017325517 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 11017325517 - 28 = 11017325261 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11017325117) 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, 1345917 + ... + 1354077.
It is an arithmetic number, because the mean of its divisors is an integer number (673038520).
Almost surely, 211017325517 is an apocalyptic number.
It is an amenable number.
11017325517 is a deficient number, since it is larger than the sum of its proper divisors (5135598963).
11017325517 is a wasteful number, since it uses less digits than its factorization.
11017325517 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11905 (or 11894 counting only the distinct ones).
The product of its (nonzero) digits is 7350, while the sum is 33.
Adding to 11017325517 its reverse (71552371011), we get a palindrome (82569696528).
The spelling of 11017325517 in words is "eleven billion, seventeen million, three hundred twenty-five thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •