Base | Representation |
---|---|
bin | 1110011111101… |
… | …1001010000000 |
3 | 11020101211120210 |
4 | 3213323022000 |
5 | 111031010233 |
6 | 10011034120 |
7 | 1335525246 |
oct | 347731200 |
9 | 136354523 |
10 | 60797568 |
11 | 31356127 |
12 | 1843b940 |
13 | c798cc0 |
14 | 8108796 |
15 | 550e163 |
hex | 39fb280 |
60797568 has 128 divisors (see below), whose sum is σ = 183355200. Its totient is φ = 17694720.
The previous prime is 60797557. The next prime is 60797599. The reversal of 60797568 is 86579706.
60797568 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (48).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 94528 + ... + 95168.
Almost surely, 260797568 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 60797568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91677600).
60797568 is an abundant number, since it is smaller than the sum of its proper divisors (122557632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60797568 is a wasteful number, since it uses less digits than its factorization.
60797568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690 (or 678 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 48.
The square root of 60797568 is about 7797.2795255781. The cubic root of 60797568 is about 393.2137860063.
The spelling of 60797568 in words is "sixty million, seven hundred ninety-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •