Base | Representation |
---|---|
bin | 100101100111100… |
… | …111011010001100 |
3 | 1121222121100002200 |
4 | 211213213122030 |
5 | 2243033021103 |
6 | 142343321500 |
7 | 21432422136 |
oct | 4547473214 |
9 | 1558540080 |
10 | 631142028 |
11 | 2a4299390 |
12 | 157450290 |
13 | a09b062a |
14 | 5db72056 |
15 | 3a6200a3 |
hex | 259e768c |
631142028 has 72 divisors (see below), whose sum is σ = 1782917136. Its totient is φ = 186585600.
The previous prime is 631142027. The next prime is 631142033. The reversal of 631142028 is 820241136.
631142028 is a `hidden beast` number, since 631 + 1 + 4 + 2 + 0 + 28 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 631141992 and 631142010.
It is not an unprimeable number, because it can be changed into a prime (631142021) 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, 3201 + ... + 35672.
It is an arithmetic number, because the mean of its divisors is an integer number (24762738).
Almost surely, 2631142028 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 631142028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (891458568).
631142028 is an abundant number, since it is smaller than the sum of its proper divisors (1151775108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
631142028 is a wasteful number, since it uses less digits than its factorization.
631142028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38935 (or 38930 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 631142028 is about 25122.5402378024. The cubic root of 631142028 is about 857.7795740017.
The spelling of 631142028 in words is "six hundred thirty-one million, one hundred forty-two thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •