Base | Representation |
---|---|
bin | 1110100100001… |
… | …1011110000000 |
3 | 11020221212212212 |
4 | 3221003132000 |
5 | 111120000020 |
6 | 10021241252 |
7 | 1341200630 |
oct | 351033600 |
9 | 136855785 |
10 | 61093760 |
11 | 31538712 |
12 | 18563228 |
13 | c870a70 |
14 | 81846c0 |
15 | 556bcc5 |
hex | 3a43780 |
61093760 has 128 divisors (see below), whose sum is σ = 179928000. Its totient is φ = 19316736.
The previous prime is 61093751. The next prime is 61093793. The reversal of 61093760 is 6739016.
It is a tau number, because it is divible by the number of its divisors (128).
It is a hoax number, since the sum of its digits (32) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (32).
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 15 ways as a sum of consecutive naturals, for example, 57716 + ... + 58764.
Almost surely, 261093760 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 61093760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89964000).
61093760 is an abundant number, since it is smaller than the sum of its proper divisors (118834240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61093760 is a wasteful number, since it uses less digits than its factorization.
61093760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088 (or 1076 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 32.
The square root of 61093760 is about 7816.2497401247. The cubic root of 61093760 is about 393.8513013901.
The spelling of 61093760 in words is "sixty-one million, ninety-three thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •