Base | Representation |
---|---|
bin | 1000000110111… |
… | …10100111100000 |
3 | 11201222210212100 |
4 | 10003132213200 |
5 | 114403130304 |
6 | 10425530400 |
7 | 1454111043 |
oct | 403364740 |
9 | 151883770 |
10 | 68020704 |
11 | 35439a64 |
12 | 1a943a00 |
13 | 1112794b |
14 | 9068c5a |
15 | 5e89439 |
hex | 40de9e0 |
68020704 has 72 divisors (see below), whose sum is σ = 194397840. Its totient is φ = 22560768.
The previous prime is 68020699. The next prime is 68020709. The reversal of 68020704 is 40702086.
It is an interprime number because it is at equal distance from previous prime (68020699) and next prime (68020709).
It is a tau number, because it is divible by the number of its divisors (72).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68020709) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 73557 + ... + 74475.
It is an arithmetic number, because the mean of its divisors is an integer number (2699970).
Almost surely, 268020704 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 68020704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97198920).
68020704 is an abundant number, since it is smaller than the sum of its proper divisors (126377136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68020704 is a wasteful number, since it uses less digits than its factorization.
68020704 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1192 (or 1181 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 68020704 is about 8247.4665200897. The cubic root of 68020704 is about 408.2069307859.
The spelling of 68020704 in words is "sixty-eight million, twenty thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •