Base | Representation |
---|---|
bin | 101010001100… |
… | …100100111001 |
3 | 202210222121110 |
4 | 222030210321 |
5 | 10312432221 |
6 | 1033030533 |
7 | 163010310 |
oct | 52144471 |
9 | 22728543 |
10 | 11061561 |
11 | 6275795 |
12 | 3855449 |
13 | 23a3b04 |
14 | 167d277 |
15 | e87776 |
hex | a8c939 |
11061561 has 8 divisors (see below), whose sum is σ = 16855744. Its totient is φ = 6320880.
The previous prime is 11061559. The next prime is 11061569. The reversal of 11061561 is 16516011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11061561 - 21 = 11061559 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 526741 = 11061561 / (1 + 1 + 0 + 6 + 1 + 5 + 6 + 1).
It is a Duffinian number.
It is a nialpdrome in base 15.
It is not an unprimeable number, because it can be changed into a prime (11061569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263350 + ... + 263391.
It is an arithmetic number, because the mean of its divisors is an integer number (2106968).
Almost surely, 211061561 is an apocalyptic number.
It is an amenable number.
11061561 is a deficient number, since it is larger than the sum of its proper divisors (5794183).
11061561 is an equidigital number, since it uses as much as digits as its factorization.
11061561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526751.
The product of its (nonzero) digits is 180, while the sum is 21.
The square root of 11061561 is about 3325.8925117929. The cubic root of 11061561 is about 222.8121176180.
Adding to 11061561 its reverse (16516011), we get a palindrome (27577572).
The spelling of 11061561 in words is "eleven million, sixty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •