Base | Representation |
---|---|
bin | 1110010110110… |
… | …1011010000000 |
3 | 11012022100010210 |
4 | 3211231122000 |
5 | 110403420320 |
6 | 5550354120 |
7 | 1330556436 |
oct | 345553200 |
9 | 135270123 |
10 | 60216960 |
11 | 30a99991 |
12 | 181bb940 |
13 | c62494b |
14 | 7dd6d56 |
15 | 54470e0 |
hex | 396d680 |
60216960 has 128 divisors (see below), whose sum is σ = 194860800. Its totient is φ = 15814656.
The previous prime is 60216953. The next prime is 60216977. The reversal of 60216960 is 6961206.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 151482 + ... + 151878.
It is an arithmetic number, because the mean of its divisors is an integer number (1522350).
Almost surely, 260216960 is an apocalyptic number.
60216960 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 60216960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97430400).
60216960 is an abundant number, since it is smaller than the sum of its proper divisors (134643840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60216960 is a wasteful number, since it uses less digits than its factorization.
60216960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 498 (or 486 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 30.
The square root of 60216960 is about 7759.9587627770. The cubic root of 60216960 is about 391.9580685400.
The spelling of 60216960 in words is "sixty million, two hundred sixteen thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •