Base | Representation |
---|---|
bin | 1000001011001… |
… | …00111101101100 |
3 | 11210000202201020 |
4 | 10011210331230 |
5 | 120023232423 |
6 | 10445414140 |
7 | 1461562263 |
oct | 405447554 |
9 | 153022636 |
10 | 68570988 |
11 | 35785442 |
12 | 1ab6a350 |
13 | 1128b265 |
14 | 916d5da |
15 | 60474e3 |
hex | 4164f6c |
68570988 has 12 divisors (see below), whose sum is σ = 159999000. Its totient is φ = 22856992.
The previous prime is 68570987. The next prime is 68571023. The reversal of 68570988 is 88907586.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×685709882 = 9403960790592288, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 68570988.
It is not an unprimeable number, because it can be changed into a prime (68570987) 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 3 ways as a sum of consecutive naturals, for example, 2857113 + ... + 2857136.
It is an arithmetic number, because the mean of its divisors is an integer number (13333250).
Almost surely, 268570988 is an apocalyptic number.
It is an amenable number.
68570988 is an abundant number, since it is smaller than the sum of its proper divisors (91428012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68570988 is a wasteful number, since it uses less digits than its factorization.
68570988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5714256 (or 5714254 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 51.
The square root of 68570988 is about 8280.7601100382. The cubic root of 68570988 is about 409.3047666394.
The spelling of 68570988 in words is "sixty-eight million, five hundred seventy thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •