Base | Representation |
---|---|
bin | 11101010001010… |
… | …010110010011110 |
3 | 1021020001002001200 |
4 | 131101102302132 |
5 | 2001203311140 |
6 | 120421220330 |
7 | 15112022514 |
oct | 3521226236 |
9 | 1236032050 |
10 | 491072670 |
11 | 23221a190 |
12 | 1185616a6 |
13 | 7a97a85a |
14 | 493104b4 |
15 | 2d1a3030 |
hex | 1d452c9e |
491072670 has 96 divisors (see below), whose sum is σ = 1466225280. Its totient is φ = 112777920.
The previous prime is 491072669. The next prime is 491072671. The reversal of 491072670 is 76270194.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (491072669) and next prime (491072671).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (491072671) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5757 + ... + 31863.
It is an arithmetic number, because the mean of its divisors is an integer number (15273180).
Almost surely, 2491072670 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 491072670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (733112640).
491072670 is an abundant number, since it is smaller than the sum of its proper divisors (975152610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
491072670 is a wasteful number, since it uses less digits than its factorization.
491072670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26150 (or 26147 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
The square root of 491072670 is about 22160.1595210865. The cubic root of 491072670 is about 788.9483790869.
The spelling of 491072670 in words is "four hundred ninety-one million, seventy-two thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •