Base | Representation |
---|---|
bin | 1000000111100… |
… | …00011010000000 |
3 | 11202010111211000 |
4 | 10003300122000 |
5 | 114412443233 |
6 | 10431252000 |
7 | 1454533344 |
oct | 403603200 |
9 | 152114730 |
10 | 68093568 |
11 | 35489784 |
12 | 1a97a000 |
13 | 11151b6a |
14 | 9087624 |
15 | 5ea0d13 |
hex | 40f0680 |
68093568 has 256 divisors, whose sum is σ = 227664000. Its totient is φ = 19906560.
The previous prime is 68093563. The next prime is 68093573. The reversal of 68093568 is 86539086.
68093568 is a `hidden beast` number, since 6 + 80 + 9 + 3 + 568 = 666.
It is an interprime number because it is at equal distance from previous prime (68093563) and next prime (68093573).
It is not an unprimeable number, because it can be changed into a prime (68093561) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1116258 + ... + 1116318.
Almost surely, 268093568 is an apocalyptic number.
68093568 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 68093568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113832000).
68093568 is an abundant number, since it is smaller than the sum of its proper divisors (159570432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68093568 is a wasteful number, since it uses less digits than its factorization.
68093568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The square root of 68093568 is about 8251.8826942704. The cubic root of 68093568 is about 408.3526363035.
The spelling of 68093568 in words is "sixty-eight million, ninety-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •