Base | Representation |
---|---|
bin | 100110010010000… |
… | …100110101100000 |
3 | 1122202112211101101 |
4 | 212102010311200 |
5 | 2303410210413 |
6 | 143422044144 |
7 | 21626140615 |
oct | 4622046540 |
9 | 1582484341 |
10 | 642272608 |
11 | 2aa600a0a |
12 | 15b119654 |
13 | a30a9983 |
14 | 6142c50c |
15 | 3b5bcedd |
hex | 26484d60 |
642272608 has 48 divisors (see below), whose sum is σ = 1322425440. Its totient is φ = 306482176.
The previous prime is 642272593. The next prime is 642272623. The reversal of 642272608 is 806272246.
It is an interprime number because it is at equal distance from previous prime (642272593) and next prime (642272623).
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, 497628 + ... + 498916.
It is an arithmetic number, because the mean of its divisors is an integer number (27550530).
Almost surely, 2642272608 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 642272608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (661212720).
642272608 is an abundant number, since it is smaller than the sum of its proper divisors (680152832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642272608 is a wasteful number, since it uses less digits than its factorization.
642272608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1999 (or 1991 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 37.
The square root of 642272608 is about 25343.0978374784. The cubic root of 642272608 is about 862.7927096686.
The spelling of 642272608 in words is "six hundred forty-two million, two hundred seventy-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •