Base | Representation |
---|---|
bin | 100110000110110… |
… | …101110111010000 |
3 | 1122120000012201120 |
4 | 212012311313100 |
5 | 2302131441241 |
6 | 143235002240 |
7 | 21562124100 |
oct | 4606656720 |
9 | 1576005646 |
10 | 639327696 |
11 | 2a897a3a7 |
12 | 15a139380 |
13 | a25b8417 |
14 | 60ca3200 |
15 | 3b1da666 |
hex | 261b5dd0 |
639327696 has 120 divisors (see below), whose sum is σ = 1931260320. Its totient is φ = 181714176.
The previous prime is 639327691. The next prime is 639327739. The reversal of 639327696 is 696723936.
639327696 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (639327691) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 538015 + ... + 539201.
It is an arithmetic number, because the mean of its divisors is an integer number (16093836).
Almost surely, 2639327696 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 639327696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (965630160).
639327696 is an abundant number, since it is smaller than the sum of its proper divisors (1291932624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
639327696 is a wasteful number, since it uses less digits than its factorization.
639327696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1441 (or 1428 counting only the distinct ones).
The product of its digits is 2204496, while the sum is 51.
The square root of 639327696 is about 25284.9302154465. The cubic root of 639327696 is about 861.4720129841.
The spelling of 639327696 in words is "six hundred thirty-nine million, three hundred twenty-seven thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •