Base | Representation |
---|---|
bin | 1110100000001… |
… | …0110110000000 |
3 | 11020110102210000 |
4 | 3220002312000 |
5 | 111033012211 |
6 | 10011440000 |
7 | 1336016121 |
oct | 350026600 |
9 | 136412700 |
10 | 60829056 |
11 | 31377852 |
12 | 18456000 |
13 | c7aa432 |
14 | 8116048 |
15 | 5518656 |
hex | 3a02d80 |
60829056 has 80 divisors (see below), whose sum is σ = 181057140. Its totient is φ = 20272896.
The previous prime is 60829039. The next prime is 60829057. The reversal of 60829056 is 65092806.
It is a super-2 number, since 2×608290562 = 7400348107702272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 60829056.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60829057) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 7435 + ... + 13301.
Almost surely, 260829056 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 60829056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90528570).
60829056 is an abundant number, since it is smaller than the sum of its proper divisors (120228084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60829056 is an equidigital number, since it uses as much as digits as its factorization.
60829056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5893 (or 5872 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 60829056 is about 7799.2984299871. The cubic root of 60829056 is about 393.2816581224.
The spelling of 60829056 in words is "sixty million, eight hundred twenty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •