Base | Representation |
---|---|
bin | 101000001011001… |
… | …111110100111000 |
3 | 1201222022122000010 |
4 | 220023033310320 |
5 | 2340023141143 |
6 | 150514541520 |
7 | 22463135406 |
oct | 5013176470 |
9 | 1658278003 |
10 | 674037048 |
11 | 316527013 |
12 | 1698978a0 |
13 | a984bab9 |
14 | 6573a476 |
15 | 3e294a33 |
hex | 282cfd38 |
674037048 has 64 divisors (see below), whose sum is σ = 1730484000. Its totient is φ = 218654720.
The previous prime is 674037041. The next prime is 674037059. The reversal of 674037048 is 840730476.
It is a happy number.
674037048 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 674036997 and 674037015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (674037041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 642028 + ... + 643076.
Almost surely, 2674037048 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 674037048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (865242000).
674037048 is an abundant number, since it is smaller than the sum of its proper divisors (1056446952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674037048 is a wasteful number, since it uses less digits than its factorization.
674037048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1752 (or 1748 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 39.
The square root of 674037048 is about 25962.2234795096. The cubic root of 674037048 is about 876.7879838726.
The spelling of 674037048 in words is "six hundred seventy-four million, thirty-seven thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •