Base | Representation |
---|---|
bin | 101000001100001… |
… | …000110000100000 |
3 | 1201222202110212212 |
4 | 220030020300200 |
5 | 2340103121430 |
6 | 150523541252 |
7 | 22465126310 |
oct | 5014106040 |
9 | 1658673785 |
10 | 674270240 |
11 | 316676236 |
12 | 16998a828 |
13 | a9900c97 |
14 | 6579b440 |
15 | 3e2ddb95 |
hex | 28308c20 |
674270240 has 192 divisors, whose sum is σ = 1911216384. Its totient is φ = 219967488.
The previous prime is 674270227. The next prime is 674270249. The reversal of 674270240 is 42072476.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 674270197 and 674270206.
It is not an unprimeable number, because it can be changed into a prime (674270249) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2196167 + ... + 2196473.
It is an arithmetic number, because the mean of its divisors is an integer number (9954252).
Almost surely, 2674270240 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 674270240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (955608192).
674270240 is an abundant number, since it is smaller than the sum of its proper divisors (1236946144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674270240 is a wasteful number, since it uses less digits than its factorization.
674270240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 419 (or 411 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 32.
The square root of 674270240 is about 25966.7140778343. The cubic root of 674270240 is about 876.8890843339.
The spelling of 674270240 in words is "six hundred seventy-four million, two hundred seventy thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •