Base | Representation |
---|---|
bin | 100100010000111… |
… | …110100110000000 |
3 | 1120101212110200122 |
4 | 210100332212000 |
5 | 2221224233324 |
6 | 140212435412 |
7 | 21035400515 |
oct | 4420764600 |
9 | 1511773618 |
10 | 608430464 |
11 | 2924968a4 |
12 | 14b918b68 |
13 | 9908ac35 |
14 | 5ab3d30c |
15 | 38635a5e |
hex | 2443e980 |
608430464 has 64 divisors (see below), whose sum is σ = 1289055600. Its totient is φ = 285235200.
The previous prime is 608430451. The next prime is 608430497. The reversal of 608430464 is 464034806.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 244394 + ... + 246870.
Almost surely, 2608430464 is an apocalyptic number.
608430464 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 608430464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (644527800).
608430464 is an abundant number, since it is smaller than the sum of its proper divisors (680625136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
608430464 is a wasteful number, since it uses less digits than its factorization.
608430464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2611 (or 2599 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 35.
The square root of 608430464 is about 24666.3832776514. The cubic root of 608430464 is about 847.3646005590.
The spelling of 608430464 in words is "six hundred eight million, four hundred thirty thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •