Base | Representation |
---|---|
bin | 10100100011001011… |
… | …11011001010111101 |
3 | 1001110212201202110012 |
4 | 22101211323022331 |
5 | 140043314310410 |
6 | 5022430153005 |
7 | 540253214465 |
oct | 122145731275 |
9 | 31425652405 |
10 | 11032572605 |
11 | 47516660aa |
12 | 217a952765 |
13 | 106a8c0592 |
14 | 76934cba5 |
15 | 448875605 |
hex | 29197b2bd |
11032572605 has 4 divisors (see below), whose sum is σ = 13239087132. Its totient is φ = 8826058080.
The previous prime is 11032572581. The next prime is 11032572611. The reversal of 11032572605 is 50627523011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50627523011 = 13 ⋅3894424847.
It can be written as a sum of positive squares in 2 ways, for example, as 6625471609 + 4407100996 = 81397^2 + 66386^2 .
It is not a de Polignac number, because 11032572605 - 28 = 11032572349 is a prime.
It is a Duffinian number.
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 3 ways as a sum of consecutive naturals, for example, 1103257256 + ... + 1103257265.
It is an arithmetic number, because the mean of its divisors is an integer number (3309771783).
Almost surely, 211032572605 is an apocalyptic number.
It is an amenable number.
11032572605 is a deficient number, since it is larger than the sum of its proper divisors (2206514527).
11032572605 is an equidigital number, since it uses as much as digits as its factorization.
11032572605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2206514526.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 11032572605 in words is "eleven billion, thirty-two million, five hundred seventy-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •