Base | Representation |
---|---|
bin | 100101110101000… |
… | …101001110011010 |
3 | 1122020020200100100 |
4 | 211311011032122 |
5 | 2244434001101 |
6 | 142551120230 |
7 | 21504423522 |
oct | 4565051632 |
9 | 1566220310 |
10 | 634672026 |
11 | 2a628a53a |
12 | 158673076 |
13 | a16482a1 |
14 | 60410682 |
15 | 3aabae86 |
hex | 25d4539a |
634672026 has 48 divisors (see below), whose sum is σ = 1421866368. Its totient is φ = 204444000.
The previous prime is 634672019. The next prime is 634672043. The reversal of 634672026 is 620276436.
It is a happy number.
634672026 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 97411 + ... + 103721.
It is an arithmetic number, because the mean of its divisors is an integer number (29622216).
Almost surely, 2634672026 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 634672026, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (710933184).
634672026 is an abundant number, since it is smaller than the sum of its proper divisors (787194342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
634672026 is a wasteful number, since it uses less digits than its factorization.
634672026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6507 (or 6504 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 36.
The square root of 634672026 is about 25192.6978706132. The cubic root of 634672026 is about 859.3757981806.
The spelling of 634672026 in words is "six hundred thirty-four million, six hundred seventy-two thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •