Base | Representation |
---|---|
bin | 1000001110001… |
… | …10100101001001 |
3 | 11210210002012000 |
4 | 10013012211021 |
5 | 120124031300 |
6 | 10502141213 |
7 | 1465146060 |
oct | 407064511 |
9 | 153702160 |
10 | 68970825 |
11 | 35a28890 |
12 | 1b121809 |
13 | 1139b251 |
14 | 92351d7 |
15 | 60c5c00 |
hex | 41c6949 |
68970825 has 96 divisors (see below), whose sum is σ = 158085120. Its totient is φ = 28641600.
The previous prime is 68970821. The next prime is 68970829. The reversal of 68970825 is 52807986.
It is an interprime number because it is at equal distance from previous prime (68970821) and next prime (68970829).
It is not a de Polignac number, because 68970825 - 22 = 68970821 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (68970821) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 51312 + ... + 52638.
It is an arithmetic number, because the mean of its divisors is an integer number (1646720).
Almost surely, 268970825 is an apocalyptic number.
It is an amenable number.
68970825 is an abundant number, since it is smaller than the sum of its proper divisors (89114295).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68970825 is a wasteful number, since it uses less digits than its factorization.
68970825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1364 (or 1353 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The square root of 68970825 is about 8304.8675486127. The cubic root of 68970825 is about 410.0987765183.
The spelling of 68970825 in words is "sixty-eight million, nine hundred seventy thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •