Base | Representation |
---|---|
bin | 1110011110001… |
… | …0100111111000 |
3 | 11020012201202000 |
4 | 3213202213320 |
5 | 111014301310 |
6 | 10004541000 |
7 | 1334626263 |
oct | 347424770 |
9 | 136181660 |
10 | 60697080 |
11 | 31297684 |
12 | 183b1760 |
13 | c762342 |
14 | 80bdcda |
15 | 54de4c0 |
hex | 39e29f8 |
60697080 has 128 divisors (see below), whose sum is σ = 207187200. Its totient is φ = 15797376.
The previous prime is 60697067. The next prime is 60697081. The reversal of 60697080 is 8079606.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60697081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45787 + ... + 47093.
It is an arithmetic number, because the mean of its divisors is an integer number (1618650).
Almost surely, 260697080 is an apocalyptic number.
60697080 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 60697080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103593600).
60697080 is an abundant number, since it is smaller than the sum of its proper divisors (146490120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60697080 is a wasteful number, since it uses less digits than its factorization.
60697080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1370 (or 1360 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 60697080 is about 7790.8330748387. The cubic root of 60697080 is about 392.9970281227.
The spelling of 60697080 in words is "sixty million, six hundred ninety-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •