Base | Representation |
---|---|
bin | 1000001011011… |
… | …10101000101000 |
3 | 11210002210001100 |
4 | 10011232220220 |
5 | 120031014400 |
6 | 10450321400 |
7 | 1462115622 |
oct | 405565050 |
9 | 153083040 |
10 | 68610600 |
11 | 35802183 |
12 | 1ab89260 |
13 | 112a32b6 |
14 | 917dc12 |
15 | 6054100 |
hex | 416ea28 |
68610600 has 144 divisors (see below), whose sum is σ = 235609920. Its totient is φ = 17884800.
The previous prime is 68610571. The next prime is 68610601. The reversal of 68610600 is 601686.
It is not an unprimeable number, because it can be changed into a prime (68610601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 84195 + ... + 85005.
It is an arithmetic number, because the mean of its divisors is an integer number (1636180).
Almost surely, 268610600 is an apocalyptic number.
68610600 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 68610600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117804960).
68610600 is an abundant number, since it is smaller than the sum of its proper divisors (166999320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68610600 is a wasteful number, since it uses less digits than its factorization.
68610600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880 (or 868 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 68610600 is about 8283.1515741293. The cubic root of 68610600 is about 409.3835670177.
The spelling of 68610600 in words is "sixty-eight million, six hundred ten thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •