Base | Representation |
---|---|
bin | 111011010111… |
… | …0101000111100 |
3 | 2011120021010210 |
4 | 1312232220330 |
5 | 30431432103 |
6 | 3031032420 |
7 | 525356415 |
oct | 166565074 |
9 | 64507123 |
10 | 31124028 |
11 | 16628a41 |
12 | a50b710 |
13 | 65a97b0 |
14 | 41c280c |
15 | 2aebe03 |
hex | 1daea3c |
31124028 has 48 divisors (see below), whose sum is σ = 78857856. Its totient is φ = 9497280.
The previous prime is 31124021. The next prime is 31124029. The reversal of 31124028 is 82042113.
It is a junction number, because it is equal to n+sod(n) for n = 31123995 and 31124013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31124021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19675 + ... + 21197.
It is an arithmetic number, because the mean of its divisors is an integer number (1642872).
Almost surely, 231124028 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 31124028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39428928).
31124028 is an abundant number, since it is smaller than the sum of its proper divisors (47733828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31124028 is a wasteful number, since it uses less digits than its factorization.
31124028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1674 (or 1672 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 31124028 is about 5578.8912877022. The cubic root of 31124028 is about 314.5564530907.
It can be divided in two parts, 3112 and 4028, that added together give a triangular number (7140 = T119).
The spelling of 31124028 in words is "thirty-one million, one hundred twenty-four thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •