Base | Representation |
---|---|
bin | 1110101111111… |
… | …1101001110000 |
3 | 11022102001020000 |
4 | 3223333221300 |
5 | 111314131220 |
6 | 10045550000 |
7 | 1350561102 |
oct | 353775160 |
9 | 138361200 |
10 | 61864560 |
11 | 31a1483a |
12 | 18875300 |
13 | ca80864 |
14 | 8305572 |
15 | 5670390 |
hex | 3affa70 |
61864560 has 100 divisors (see below), whose sum is σ = 214887288. Its totient is φ = 16495488.
The previous prime is 61864559. The next prime is 61864571. The reversal of 61864560 is 6546816.
61864560 is a `hidden beast` number, since 6 + 1 + 8 + 645 + 6 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1707 + ... + 11253.
Almost surely, 261864560 is an apocalyptic number.
61864560 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61864560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107443644).
61864560 is an abundant number, since it is smaller than the sum of its proper divisors (153022728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61864560 is a wasteful number, since it uses less digits than its factorization.
61864560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9572 (or 9557 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 61864560 is about 7865.4027233194. The cubic root of 61864560 is about 395.5007482500.
The spelling of 61864560 in words is "sixty-one million, eight hundred sixty-four thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •