Base | Representation |
---|---|
bin | 1110100100111… |
… | …0110001100001 |
3 | 11021001020101212 |
4 | 3221032301201 |
5 | 111122440230 |
6 | 10022235505 |
7 | 1341452630 |
oct | 351166141 |
9 | 137036355 |
10 | 61140065 |
11 | 3156a488 |
12 | 18585b95 |
13 | c888b6c |
14 | 8197517 |
15 | 557a895 |
hex | 3a4ec61 |
61140065 has 8 divisors (see below), whose sum is σ = 83849280. Its totient is φ = 41924592.
The previous prime is 61140059. The next prime is 61140071. The reversal of 61140065 is 56004116.
61140065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (61140059) and next prime (61140071).
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-61140065 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 61140065.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 873395 + ... + 873464.
It is an arithmetic number, because the mean of its divisors is an integer number (10481160).
Almost surely, 261140065 is an apocalyptic number.
It is an amenable number.
61140065 is a deficient number, since it is larger than the sum of its proper divisors (22709215).
61140065 is a wasteful number, since it uses less digits than its factorization.
61140065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1746871.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 61140065 is about 7819.2112773604. The cubic root of 61140065 is about 393.9507806107.
The spelling of 61140065 in words is "sixty-one million, one hundred forty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •