Base | Representation |
---|---|
bin | 1000001110001… |
… | …10011010010100 |
3 | 11210210001020100 |
4 | 10013012122110 |
5 | 120124021012 |
6 | 10502134100 |
7 | 1465144050 |
oct | 407063224 |
9 | 153701210 |
10 | 68970132 |
11 | 35a28310 |
12 | 1b121330 |
13 | 1139ab3a |
14 | 9234c60 |
15 | 60c58dc |
hex | 41c6694 |
68970132 has 144 divisors (see below), whose sum is σ = 220147200. Its totient is φ = 17686080.
The previous prime is 68970107. The next prime is 68970137. The reversal of 68970132 is 23107986.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68970137) 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 47 ways as a sum of consecutive naturals, for example, 385219 + ... + 385397.
It is an arithmetic number, because the mean of its divisors is an integer number (1528800).
Almost surely, 268970132 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 68970132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110073600).
68970132 is an abundant number, since it is smaller than the sum of its proper divisors (151177068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68970132 is a wasteful number, since it uses less digits than its factorization.
68970132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346 (or 341 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 68970132 is about 8304.8258259882. The cubic root of 68970132 is about 410.0974029935.
The spelling of 68970132 in words is "sixty-eight million, nine hundred seventy thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •