Base | Representation |
---|---|
bin | 100110010001100… |
… | …011101010000110 |
3 | 1122202021220222010 |
4 | 212101203222012 |
5 | 2303341333320 |
6 | 143415115050 |
7 | 21625033455 |
oct | 4621435206 |
9 | 1582256863 |
10 | 642136710 |
11 | 2aa5188a6 |
12 | 15b072a86 |
13 | a305cb67 |
14 | 613d4b9c |
15 | 3b592ae0 |
hex | 26463a86 |
642136710 has 64 divisors (see below), whose sum is σ = 1574318592. Its totient is φ = 167582976.
The previous prime is 642136687. The next prime is 642136757. The reversal of 642136710 is 17631246.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 334714 + ... + 336626.
It is an arithmetic number, because the mean of its divisors is an integer number (24598728).
Almost surely, 2642136710 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 642136710, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (787159296).
642136710 is an abundant number, since it is smaller than the sum of its proper divisors (932181882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642136710 is a wasteful number, since it uses less digits than its factorization.
642136710 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2157.
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 642136710 is about 25340.4165316989. The cubic root of 642136710 is about 862.7318528128.
Adding to 642136710 its reverse (17631246), we get a palindrome (659767956).
The spelling of 642136710 in words is "six hundred forty-two million, one hundred thirty-six thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •