Base | Representation |
---|---|
bin | 1110011101101… |
… | …0110111111100 |
3 | 11020011010012110 |
4 | 3213122313330 |
5 | 111012242330 |
6 | 10004134020 |
7 | 1334434611 |
oct | 347326774 |
9 | 136133173 |
10 | 60665340 |
11 | 3127584a |
12 | 18397310 |
13 | c750a68 |
14 | 80b2508 |
15 | 54d4db0 |
hex | 39dadfc |
60665340 has 48 divisors (see below), whose sum is σ = 170932608. Its totient is φ = 16075584.
The previous prime is 60665327. The next prime is 60665359. The reversal of 60665340 is 4356606.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 60665298 and 60665307.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6679 + ... + 12881.
It is an arithmetic number, because the mean of its divisors is an integer number (3561096).
Almost surely, 260665340 is an apocalyptic number.
60665340 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 60665340, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85466304).
60665340 is an abundant number, since it is smaller than the sum of its proper divisors (110267268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60665340 is a wasteful number, since it uses less digits than its factorization.
60665340 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6378 (or 6376 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
The square root of 60665340 is about 7788.7957990950. The cubic root of 60665340 is about 392.9285135661.
The spelling of 60665340 in words is "sixty million, six hundred sixty-five thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •