Base | Representation |
---|---|
bin | 1010001101000… |
… | …11010011101001 |
3 | 12222002010000021 |
4 | 11012203103221 |
5 | 133403303221 |
6 | 12254440441 |
7 | 2056422031 |
oct | 506432351 |
9 | 188063007 |
10 | 85603561 |
11 | 4435924a |
12 | 24803121 |
13 | 14972ac4 |
14 | b5248c1 |
15 | 77ae041 |
hex | 51a34e9 |
85603561 has 4 divisors (see below), whose sum is σ = 86170624. Its totient is φ = 85036500.
The previous prime is 85603549. The next prime is 85603579. The reversal of 85603561 is 16530658.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16530658 = 2 ⋅8265329.
It is a cyclic number.
It is not a de Polignac number, because 85603561 - 27 = 85603433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (85603541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 283305 + ... + 283606.
It is an arithmetic number, because the mean of its divisors is an integer number (21542656).
Almost surely, 285603561 is an apocalyptic number.
It is an amenable number.
85603561 is a deficient number, since it is larger than the sum of its proper divisors (567063).
85603561 is a wasteful number, since it uses less digits than its factorization.
85603561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567062.
The product of its (nonzero) digits is 21600, while the sum is 34.
The square root of 85603561 is about 9252.2192472941. The cubic root of 85603561 is about 440.7212018775.
It can be divided in two parts, 8560 and 3561, that added together give a palindrome (12121).
The spelling of 85603561 in words is "eighty-five million, six hundred three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •