Base | Representation |
---|---|
bin | 111011110101… |
… | …1111011101000 |
3 | 2012001000112000 |
4 | 1313223323220 |
5 | 31013000310 |
6 | 3040251000 |
7 | 530453352 |
oct | 167537350 |
9 | 65030460 |
10 | 31375080 |
11 | 1678a620 |
12 | a610a60 |
13 | 6666b49 |
14 | 424a0d2 |
15 | 2b4b4c0 |
hex | 1debee8 |
31375080 has 256 divisors, whose sum is σ = 120960000. Its totient is φ = 7153920.
The previous prime is 31375051. The next prime is 31375103. The reversal of 31375080 is 8057313.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 225651 + ... + 225789.
It is an arithmetic number, because the mean of its divisors is an integer number (472500).
Almost surely, 231375080 is an apocalyptic number.
31375080 is a gapful number since it is divisible by the number (30) 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 31375080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60480000).
31375080 is an abundant number, since it is smaller than the sum of its proper divisors (89584920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31375080 is a wasteful number, since it uses less digits than its factorization.
31375080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189 (or 179 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 31375080 is about 5601.3462667470. The cubic root of 31375080 is about 315.3999455017.
The spelling of 31375080 in words is "thirty-one million, three hundred seventy-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •