Base | Representation |
---|---|
bin | 1110101010100… |
… | …0000001110100 |
3 | 11021201210220010 |
4 | 3222220001310 |
5 | 111221140102 |
6 | 10034140220 |
7 | 1344534525 |
oct | 352500164 |
9 | 137653803 |
10 | 61505652 |
11 | 3179a11a |
12 | 18721670 |
13 | c9863a0 |
14 | 825084c |
15 | 55edd6c |
hex | 3aa8074 |
61505652 has 96 divisors (see below), whose sum is σ = 162062208. Its totient is φ = 18031104.
The previous prime is 61505651. The next prime is 61505659. The reversal of 61505652 is 25650516.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61505651) 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 31 ways as a sum of consecutive naturals, for example, 355438 + ... + 355610.
It is an arithmetic number, because the mean of its divisors is an integer number (1688148).
Almost surely, 261505652 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61505652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81031104).
61505652 is an abundant number, since it is smaller than the sum of its proper divisors (100556556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61505652 is a wasteful number, since it uses less digits than its factorization.
61505652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289 (or 287 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The square root of 61505652 is about 7842.5539207582. The cubic root of 61505652 is about 394.7344302599.
The spelling of 61505652 in words is "sixty-one million, five hundred five thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •