Base | Representation |
---|---|
bin | 1110011110000… |
… | …0011010111000 |
3 | 11020012021100210 |
4 | 3213200122320 |
5 | 111014004211 |
6 | 10004431120 |
7 | 1334561052 |
oct | 347403270 |
9 | 136167323 |
10 | 60688056 |
11 | 31290920 |
12 | 183a84a0 |
13 | c75b1c0 |
14 | 80ba8d2 |
15 | 54db9a6 |
hex | 39e06b8 |
60688056 has 64 divisors (see below), whose sum is σ = 178254720. Its totient is φ = 16974720.
The previous prime is 60688027. The next prime is 60688057. The reversal of 60688056 is 65088606.
60688056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60688057) by changing a digit.
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, 5410 + ... + 12273.
It is an arithmetic number, because the mean of its divisors is an integer number (2785230).
Almost surely, 260688056 is an apocalyptic number.
60688056 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
60688056 is an abundant number, since it is smaller than the sum of its proper divisors (117566664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60688056 is a wasteful number, since it uses less digits than its factorization.
60688056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17716 (or 17712 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 39.
The square root of 60688056 is about 7790.2539111379. The cubic root of 60688056 is about 392.9775511784.
The spelling of 60688056 in words is "sixty million, six hundred eighty-eight thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •