Base | Representation |
---|---|
bin | 100110010010101… |
… | …001000011001110 |
3 | 1122202211100212020 |
4 | 212102221003032 |
5 | 2303424432232 |
6 | 143425151010 |
7 | 21630326232 |
oct | 4622510316 |
9 | 1582740766 |
10 | 642420942 |
11 | 2aa6a23a9 |
12 | 15b18b466 |
13 | a312c347 |
14 | 6146a5c2 |
15 | 3b5ebe2c |
hex | 264a90ce |
642420942 has 8 divisors (see below), whose sum is σ = 1284841896. Its totient is φ = 214140312.
The previous prime is 642420941. The next prime is 642420949. The reversal of 642420942 is 249024246.
It is a sphenic number, since it is the product of 3 distinct primes.
642420942 is an admirable number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642420941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53535073 + ... + 53535084.
It is an arithmetic number, because the mean of its divisors is an integer number (160605237).
Almost surely, 2642420942 is an apocalyptic number.
642420942 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642420942 is a wasteful number, since it uses less digits than its factorization.
642420942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107070162.
The product of its (nonzero) digits is 27648, while the sum is 33.
The square root of 642420942 is about 25346.0241852642. The cubic root of 642420942 is about 862.8591257256.
The spelling of 642420942 in words is "six hundred forty-two million, four hundred twenty thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •