Base | Representation |
---|---|
bin | 1000001000011… |
… | …01111101010000 |
3 | 11202100122211222 |
4 | 10010031331100 |
5 | 114430331413 |
6 | 10434024212 |
7 | 1455546260 |
oct | 404157520 |
9 | 152318758 |
10 | 68214608 |
11 | 35561710 |
12 | 1aa18068 |
13 | 11194c97 |
14 | 90b97a0 |
15 | 5ec6b08 |
hex | 410df50 |
68214608 has 80 divisors (see below), whose sum is σ = 174524544. Its totient is φ = 25006080.
The previous prime is 68214593. The next prime is 68214623. The reversal of 68214608 is 80641286.
It is an interprime number because it is at equal distance from previous prime (68214593) and next prime (68214623).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 19316 + ... + 22572.
Almost surely, 268214608 is an apocalyptic number.
68214608 is a gapful number since it is divisible by the number (68) 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 68214608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87262272).
68214608 is an abundant number, since it is smaller than the sum of its proper divisors (106309936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68214608 is a wasteful number, since it uses less digits than its factorization.
68214608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3300 (or 3294 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 35.
The square root of 68214608 is about 8259.2135218797. The cubic root of 68214608 is about 408.5944493804.
The spelling of 68214608 in words is "sixty-eight million, two hundred fourteen thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •