Base | Representation |
---|---|
bin | 1000000111001… |
… | …01001011001000 |
3 | 11202001011201000 |
4 | 10003211023020 |
5 | 114410010220 |
6 | 10430255000 |
7 | 1454252250 |
oct | 403451310 |
9 | 152034630 |
10 | 68047560 |
11 | 35458159 |
12 | 1a957460 |
13 | 11136c39 |
14 | 9074960 |
15 | 5e92390 |
hex | 40e52c8 |
68047560 has 128 divisors (see below), whose sum is σ = 259257600. Its totient is φ = 15552000.
The previous prime is 68047541. The next prime is 68047561. The reversal of 68047560 is 6574086.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (68047561) 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, 3060 + ... + 12060.
It is an arithmetic number, because the mean of its divisors is an integer number (2025450).
Almost surely, 268047560 is an apocalyptic number.
68047560 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 68047560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129628800).
68047560 is an abundant number, since it is smaller than the sum of its proper divisors (191210040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68047560 is a wasteful number, since it uses less digits than its factorization.
68047560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9028 (or 9018 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 68047560 is about 8249.0944957613. The cubic root of 68047560 is about 408.2606466019.
The spelling of 68047560 in words is "sixty-eight million, forty-seven thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •