Base | Representation |
---|---|
bin | 1000001111011… |
… | …01000111110000 |
3 | 11211002002201210 |
4 | 10013231013300 |
5 | 120144104223 |
6 | 10505400120 |
7 | 1466404236 |
oct | 407550760 |
9 | 154062653 |
10 | 69128688 |
11 | 36026452 |
12 | 1b199040 |
13 | 11425065 |
14 | 9276956 |
15 | 6107893 |
hex | 41ed1f0 |
69128688 has 80 divisors (see below), whose sum is σ = 189372800. Its totient is φ = 21669120.
The previous prime is 69128687. The next prime is 69128701. The reversal of 69128688 is 88682196.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69128687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 208683 + ... + 209013.
It is an arithmetic number, because the mean of its divisors is an integer number (2367160).
Almost surely, 269128688 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 69128688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94686400).
69128688 is an abundant number, since it is smaller than the sum of its proper divisors (120244112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69128688 is a wasteful number, since it uses less digits than its factorization.
69128688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590 (or 584 counting only the distinct ones).
The product of its digits is 331776, while the sum is 48.
The square root of 69128688 is about 8314.3663619064. The cubic root of 69128688 is about 410.4114212402.
The spelling of 69128688 in words is "sixty-nine million, one hundred twenty-eight thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •