Base | Representation |
---|---|
bin | 10100110111010001… |
… | …10100111001110101 |
3 | 1001220121212010011012 |
4 | 22123220310321311 |
5 | 140414440334100 |
6 | 5051250322005 |
7 | 544400553221 |
oct | 123350647165 |
9 | 31817763135 |
10 | 11201105525 |
11 | 4828806405 |
12 | 2207289305 |
13 | 10967aabbc |
14 | 78389d781 |
15 | 458566135 |
hex | 29ba34e75 |
11201105525 has 12 divisors (see below), whose sum is σ = 13905680292. Its totient is φ = 8950362240.
The previous prime is 11201105507. The next prime is 11201105533. The reversal of 11201105525 is 52550110211.
It can be written as a sum of positive squares in 6 ways, for example, as 839087089 + 10362018436 = 28967^2 + 101794^2 .
It is not a de Polignac number, because 11201105525 - 28 = 11201105269 is a prime.
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 11201105525.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 241304 + ... + 283953.
It is an arithmetic number, because the mean of its divisors is an integer number (1158806691).
Almost surely, 211201105525 is an apocalyptic number.
It is an amenable number.
11201105525 is a deficient number, since it is larger than the sum of its proper divisors (2704574767).
11201105525 is an equidigital number, since it uses as much as digits as its factorization.
11201105525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526120 (or 526115 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 23.
Adding to 11201105525 its reverse (52550110211), we get a palindrome (63751215736).
The spelling of 11201105525 in words is "eleven billion, two hundred one million, one hundred five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •