Base | Representation |
---|---|
bin | 101000001011110… |
… | …000001100110000 |
3 | 1201222120100220020 |
4 | 220023300030300 |
5 | 2340041412043 |
6 | 150521443440 |
7 | 22464230115 |
oct | 5013601460 |
9 | 1658510806 |
10 | 674169648 |
11 | 3166076a9 |
12 | 169940580 |
13 | a9897269 |
14 | 6577290c |
15 | 3e2bde83 |
hex | 282f0330 |
674169648 has 80 divisors (see below), whose sum is σ = 1809217536. Its totient is φ = 216092160.
The previous prime is 674169589. The next prime is 674169649. The reversal of 674169648 is 846961476.
It is a self number, because there is not a number n which added to its sum of digits gives 674169648.
It is not an unprimeable number, because it can be changed into a prime (674169649) 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 15 ways as a sum of consecutive naturals, for example, 247140 + ... + 249852.
Almost surely, 2674169648 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 674169648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (904608768).
674169648 is an abundant number, since it is smaller than the sum of its proper divisors (1135047888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
674169648 is a wasteful number, since it uses less digits than its factorization.
674169648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2922 (or 2916 counting only the distinct ones).
The product of its digits is 1741824, while the sum is 51.
The square root of 674169648 is about 25964.7770643231. Note that the first 3 decimals coincide. The cubic root of 674169648 is about 876.8454755016.
The spelling of 674169648 in words is "six hundred seventy-four million, one hundred sixty-nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •