Base | Representation |
---|---|
bin | 1000001110000… |
… | …00011101100000 |
3 | 11210201210210200 |
4 | 10013000131200 |
5 | 120122231020 |
6 | 10501425200 |
7 | 1465013022 |
oct | 407003540 |
9 | 153653720 |
10 | 68945760 |
11 | 35a10a74 |
12 | 1b10b200 |
13 | 1138ca10 |
14 | 922a012 |
15 | 60bd590 |
hex | 41c0760 |
68945760 has 288 divisors, whose sum is σ = 264176640. Its totient is φ = 16257024.
The previous prime is 68945759. The next prime is 68945791. The reversal of 68945760 is 6754986.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 542817 + ... + 542943.
It is an arithmetic number, because the mean of its divisors is an integer number (917280).
Almost surely, 268945760 is an apocalyptic number.
68945760 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 68945760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132088320).
68945760 is an abundant number, since it is smaller than the sum of its proper divisors (195230880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68945760 is a wasteful number, since it uses less digits than its factorization.
68945760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190 (or 179 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 68945760 is about 8303.3583567133. The cubic root of 68945760 is about 410.0490918810.
The spelling of 68945760 in words is "sixty-eight million, nine hundred forty-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •