Base | Representation |
---|---|
bin | 1110011111110… |
… | …0000011100000 |
3 | 11020102000122002 |
4 | 3213330003200 |
5 | 111031114443 |
6 | 10011103132 |
7 | 1335542054 |
oct | 347740340 |
9 | 136360562 |
10 | 60801248 |
11 | 31358972 |
12 | 18441aa8 |
13 | c79a891 |
14 | 8109c64 |
15 | 55102b8 |
hex | 39fc0e0 |
60801248 has 24 divisors (see below), whose sum is σ = 126744912. Its totient is φ = 28612096.
The previous prime is 60801239. The next prime is 60801271. The reversal of 60801248 is 84210806.
60801248 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 60801248.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 55340 + ... + 56427.
It is an arithmetic number, because the mean of its divisors is an integer number (5281038).
Almost surely, 260801248 is an apocalyptic number.
60801248 is a gapful number since it is divisible by the number (68) formed by its first and last digit.
It is an amenable number.
60801248 is an abundant number, since it is smaller than the sum of its proper divisors (65943664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60801248 is a wasteful number, since it uses less digits than its factorization.
60801248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111794 (or 111786 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 29.
The square root of 60801248 is about 7797.5155017480. The cubic root of 60801248 is about 393.2217194242.
The spelling of 60801248 in words is "sixty million, eight hundred one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •