Base | Representation |
---|---|
bin | 100110010010111… |
… | …100010110100000 |
3 | 1122202222101022022 |
4 | 212102330112200 |
5 | 2303440000000 |
6 | 143431001012 |
7 | 21631105562 |
oct | 4622742640 |
9 | 1582871268 |
10 | 642500000 |
11 | 2aa74683a |
12 | 15b209168 |
13 | a315931c |
14 | 6148b332 |
15 | 3b615585 |
hex | 264bc5a0 |
642500000 has 96 divisors (see below), whose sum is σ = 1587300624. Its totient is φ = 256000000.
The previous prime is 642499999. The next prime is 642500003. The reversal of 642500000 is 5246.
It can be written as a sum of positive squares in 8 ways, for example, as 426174736 + 216325264 = 20644^2 + 14708^2 .
It is not an unprimeable number, because it can be changed into a prime (642500003) 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 15 ways as a sum of consecutive naturals, for example, 2499872 + ... + 2500128.
Almost surely, 2642500000 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 642500000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (793650312).
642500000 is an abundant number, since it is smaller than the sum of its proper divisors (944800624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642500000 is an frugal number, since it uses more digits than its factorization.
642500000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 642500000 is about 25347.5837112732. The cubic root of 642500000 is about 862.8945195068.
Adding to 642500000 its reverse (5246), we get a palindrome (642505246).
The spelling of 642500000 in words is "six hundred forty-two million, five hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •