Base | Representation |
---|---|
bin | 1110010011100… |
… | …0110100011001 |
3 | 11011220101200001 |
4 | 3210320310121 |
5 | 110330022221 |
6 | 5542013001 |
7 | 1326001444 |
oct | 344706431 |
9 | 134811601 |
10 | 60001561 |
11 | 30962074 |
12 | 18117161 |
13 | c57a8a9 |
14 | 7d7c65b |
15 | 5403391 |
hex | 3938d19 |
60001561 has 4 divisors (see below), whose sum is σ = 60130512. Its totient is φ = 59872612.
The previous prime is 60001553. The next prime is 60001567. The reversal of 60001561 is 16510006.
60001561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 60001561 - 23 = 60001553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (60001567) 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, 63775 + ... + 64708.
It is an arithmetic number, because the mean of its divisors is an integer number (15032628).
Almost surely, 260001561 is an apocalyptic number.
It is an amenable number.
60001561 is a deficient number, since it is larger than the sum of its proper divisors (128951).
60001561 is a wasteful number, since it uses less digits than its factorization.
60001561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128950.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 60001561 is about 7746.0674538762. The cubic root of 60001561 is about 391.4901591477.
Adding to 60001561 its reverse (16510006), we get a palindrome (76511567).
The spelling of 60001561 in words is "sixty million, one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •