Base | Representation |
---|---|
bin | 1110101001010… |
… | …0110110000000 |
3 | 11021120211002202 |
4 | 3222110312000 |
5 | 111211131242 |
6 | 10032332332 |
7 | 1344056450 |
oct | 352246600 |
9 | 137524082 |
10 | 61427072 |
11 | 31746083 |
12 | 186a40a8 |
13 | c9596a5 |
14 | 822dd60 |
15 | 55d5932 |
hex | 3a94d80 |
61427072 has 64 divisors (see below), whose sum is σ = 141004800. Its totient is φ = 26110464.
The previous prime is 61427033. The next prime is 61427081. The reversal of 61427072 is 27072416.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 160193 + ... + 160575.
It is an arithmetic number, because the mean of its divisors is an integer number (2203200).
Almost surely, 261427072 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 61427072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70502400).
61427072 is an abundant number, since it is smaller than the sum of its proper divisors (79577728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61427072 is a wasteful number, since it uses less digits than its factorization.
61427072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583 (or 571 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 29.
The square root of 61427072 is about 7837.5424719742. The cubic root of 61427072 is about 394.5662535715.
Adding to 61427072 its reverse (27072416), we get a palindrome (88499488).
The spelling of 61427072 in words is "sixty-one million, four hundred twenty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •