Base | Representation |
---|---|
bin | 1111001001110… |
… | …1100111001101 |
3 | 11102121012010022 |
4 | 3302131213031 |
5 | 112232411031 |
6 | 10150151525 |
7 | 1401152351 |
oct | 362354715 |
9 | 142535108 |
10 | 63560141 |
11 | 32972747 |
12 | 193525a5 |
13 | 10225568 |
14 | 8627461 |
15 | 58a797b |
hex | 3c9d9cd |
63560141 has 8 divisors (see below), whose sum is σ = 66120600. Its totient is φ = 61024320.
The previous prime is 63560089. The next prime is 63560173. The reversal of 63560141 is 14106536.
It can be written as a sum of positive squares in 4 ways, for example, as 11055625 + 52504516 = 3325^2 + 7246^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63560141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 63560141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63560041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 806 + ... + 11303.
It is an arithmetic number, because the mean of its divisors is an integer number (8265075).
Almost surely, 263560141 is an apocalyptic number.
It is an amenable number.
63560141 is a deficient number, since it is larger than the sum of its proper divisors (2560459).
63560141 is a wasteful number, since it uses less digits than its factorization.
63560141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12319.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 63560141 is about 7972.4614141431. The cubic root of 63560141 is about 399.0815196823.
Adding to 63560141 its reverse (14106536), we get a palindrome (77666677).
The spelling of 63560141 in words is "sixty-three million, five hundred sixty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •