Base | Representation |
---|---|
bin | 1000001000100… |
… | …10001111000000 |
3 | 11202101112212212 |
4 | 10010102033000 |
5 | 114431412003 |
6 | 10434241252 |
7 | 1455651326 |
oct | 404221700 |
9 | 152345785 |
10 | 68232128 |
11 | 35573898 |
12 | 1aa26228 |
13 | 1119cc53 |
14 | 90c1d16 |
15 | 5ecbdd8 |
hex | 41123c0 |
68232128 has 56 divisors (see below), whose sum is σ = 141884400. Its totient is φ = 32514048.
The previous prime is 68232121. The next prime is 68232137. The reversal of 68232128 is 82123286.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 68232094 and 68232103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68232121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 179843 + ... + 180221.
It is an arithmetic number, because the mean of its divisors is an integer number (2533650).
Almost surely, 268232128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68232128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70942200).
68232128 is an abundant number, since it is smaller than the sum of its proper divisors (73652272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68232128 is a wasteful number, since it uses less digits than its factorization.
68232128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 517 (or 507 counting only the distinct ones).
The product of its digits is 9216, while the sum is 32.
The square root of 68232128 is about 8260.2740874622. The cubic root of 68232128 is about 408.6294270398.
The spelling of 68232128 in words is "sixty-eight million, two hundred thirty-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •