Base | Representation |
---|---|
bin | 1000001011010… |
… | …10010000000000 |
3 | 11210001212102011 |
4 | 10011222100000 |
5 | 120024431030 |
6 | 10450102304 |
7 | 1462012354 |
oct | 405522000 |
9 | 153055364 |
10 | 68592640 |
11 | 3579a736 |
12 | 1ab7a994 |
13 | 1129807c |
14 | 9177464 |
15 | 604db2a |
hex | 416a400 |
68592640 has 44 divisors (see below), whose sum is σ = 164554236. Its totient is φ = 27435008.
The previous prime is 68592617. The next prime is 68592649. The reversal of 68592640 is 4629586.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 11075584 + 57517056 = 3328^2 + 7584^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 68592593 and 68592602.
It is not an unprimeable number, because it can be changed into a prime (68592649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1579 + ... + 11818.
It is an arithmetic number, because the mean of its divisors is an integer number (3739869).
Almost surely, 268592640 is an apocalyptic number.
It is an amenable number.
68592640 is an abundant number, since it is smaller than the sum of its proper divisors (95961596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68592640 is a wasteful number, since it uses less digits than its factorization.
68592640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13422 (or 13404 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 40.
The square root of 68592640 is about 8282.0673747561. The cubic root of 68592640 is about 409.3478428462.
The spelling of 68592640 in words is "sixty-eight million, five hundred ninety-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •