Base | Representation |
---|---|
bin | 100101110010111… |
… | …100110101100000 |
3 | 1122012012022000121 |
4 | 211302330311200 |
5 | 2244313112001 |
6 | 142531130024 |
7 | 21466606021 |
oct | 4562746540 |
9 | 1565168017 |
10 | 634113376 |
11 | 2a5a38846 |
12 | 158443914 |
13 | a14b0c20 |
14 | 60306c48 |
15 | 3aa0a6a1 |
hex | 25cbcd60 |
634113376 has 48 divisors (see below), whose sum is σ = 1346771664. Its totient is φ = 292161024.
The previous prime is 634113373. The next prime is 634113383. The reversal of 634113376 is 673311436.
634113376 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 (634113371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 353955 + ... + 355741.
It is an arithmetic number, because the mean of its divisors is an integer number (28057743).
Almost surely, 2634113376 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 634113376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (673385832).
634113376 is an abundant number, since it is smaller than the sum of its proper divisors (712658288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
634113376 is a wasteful number, since it uses less digits than its factorization.
634113376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2663 (or 2655 counting only the distinct ones).
The product of its digits is 27216, while the sum is 34.
The square root of 634113376 is about 25181.6078914751. The cubic root of 634113376 is about 859.1235780310.
The spelling of 634113376 in words is "six hundred thirty-four million, one hundred thirteen thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •