Base | Representation |
---|---|
bin | 1110010110000… |
… | …1100001010000 |
3 | 11012012212100112 |
4 | 3211201201100 |
5 | 110400341042 |
6 | 5545340452 |
7 | 1330264463 |
oct | 345414120 |
9 | 135185315 |
10 | 60168272 |
11 | 30a6634a |
12 | 18197728 |
13 | c608738 |
14 | 7dc32da |
15 | 5437982 |
hex | 3961850 |
60168272 has 80 divisors (see below), whose sum is σ = 128563200. Its totient is φ = 27202560.
The previous prime is 60168271. The next prime is 60168293. The reversal of 60168272 is 27286106.
60168272 is a modest number, since divided by 8272 gives 6016 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60168271) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 676004 + ... + 676092.
It is an arithmetic number, because the mean of its divisors is an integer number (1607040).
Almost surely, 260168272 is an apocalyptic number.
60168272 is a gapful number since it is divisible by the number (62) 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 60168272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64281600).
60168272 is an abundant number, since it is smaller than the sum of its proper divisors (68394928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60168272 is a wasteful number, since it uses less digits than its factorization.
60168272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204 (or 198 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 60168272 is about 7756.8209983214. The cubic root of 60168272 is about 391.8524017418.
The spelling of 60168272 in words is "sixty million, one hundred sixty-eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •