Base | Representation |
---|---|
bin | 1110100100000… |
… | …0101111101100 |
3 | 11020221022120200 |
4 | 3221000233230 |
5 | 111114120404 |
6 | 10021113500 |
7 | 1341123252 |
oct | 351005754 |
9 | 136838520 |
10 | 61082604 |
11 | 315302a0 |
12 | 18558890 |
13 | c86896b |
14 | 81805d2 |
15 | 5568839 |
hex | 3a40bec |
61082604 has 72 divisors (see below), whose sum is σ = 170828112. Its totient is φ = 18247680.
The previous prime is 61082603. The next prime is 61082621. The reversal of 61082604 is 40628016.
61082604 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×610826042 = 7462169022841632, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (61082603) 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 23 ways as a sum of consecutive naturals, for example, 27852 + ... + 29964.
Almost surely, 261082604 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 61082604, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85414056).
61082604 is an abundant number, since it is smaller than the sum of its proper divisors (109745508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61082604 is a wasteful number, since it uses less digits than its factorization.
61082604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2207 (or 2202 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 61082604 is about 7815.5360660674. The cubic root of 61082604 is about 393.8273269144.
The spelling of 61082604 in words is "sixty-one million, eighty-two thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •