Base | Representation |
---|---|
bin | 1010001101100… |
… | …0111000101000 |
3 | 2222121001122011 |
4 | 2203120320220 |
5 | 41431101100 |
6 | 4130005304 |
7 | 1030026613 |
oct | 243307050 |
9 | 88531564 |
10 | 42831400 |
11 | 221a4957 |
12 | 12416834 |
13 | 8b48531 |
14 | 598d17a |
15 | 3b60bba |
hex | 28d8e28 |
42831400 has 48 divisors (see below), whose sum is σ = 100038240. Its totient is φ = 17054400.
The previous prime is 42831379. The next prime is 42831401. The reversal of 42831400 is 413824.
It is not an unprimeable number, because it can be changed into a prime (42831401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 65877 + ... + 66523.
It is an arithmetic number, because the mean of its divisors is an integer number (2084130).
Almost surely, 242831400 is an apocalyptic number.
42831400 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42831400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50019120).
42831400 is an abundant number, since it is smaller than the sum of its proper divisors (57206840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42831400 is a wasteful number, since it uses less digits than its factorization.
42831400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 994 (or 985 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 42831400 is about 6544.5702685509. The cubic root of 42831400 is about 349.8813203063.
The spelling of 42831400 in words is "forty-two million, eight hundred thirty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •