Base | Representation |
---|---|
bin | 100110000011101… |
… | …010011000010110 |
3 | 1122111102212102110 |
4 | 212003222120112 |
5 | 2301423303410 |
6 | 143205051450 |
7 | 21552053133 |
oct | 4603523026 |
9 | 1574385373 |
10 | 638494230 |
11 | 2a8460190 |
12 | 1599b6b86 |
13 | a2385c4a |
14 | 60b2758a |
15 | 3b0c3720 |
hex | 260ea616 |
638494230 has 96 divisors (see below), whose sum is σ = 1714950144. Its totient is φ = 150880000.
The previous prime is 638494223. The next prime is 638494231. The reversal of 638494230 is 32494836.
638494230 = T10769 + T10770 + ... + T10779.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (638494231) 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 47 ways as a sum of consecutive naturals, for example, 554155 + ... + 555305.
It is an arithmetic number, because the mean of its divisors is an integer number (17864064).
Almost surely, 2638494230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 638494230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (857475072).
638494230 is an abundant number, since it is smaller than the sum of its proper divisors (1076455914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
638494230 is a wasteful number, since it uses less digits than its factorization.
638494230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254 (or 1213 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 39.
The square root of 638494230 is about 25268.4433632149. The cubic root of 638494230 is about 861.0974946288.
The spelling of 638494230 in words is "six hundred thirty-eight million, four hundred ninety-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •