Base | Representation |
---|---|
bin | 10010100101000… |
… | …110100011110000 |
3 | 210201112211002000 |
4 | 102211012203300 |
5 | 1114244403310 |
6 | 50533054000 |
7 | 10503354144 |
oct | 2245064360 |
9 | 721484060 |
10 | 311716080 |
11 | 14aa569a5 |
12 | 88487300 |
13 | 4c7707b0 |
14 | 2d583224 |
15 | 1c5754c0 |
hex | 129468f0 |
311716080 has 320 divisors, whose sum is σ = 1226171520. Its totient is φ = 72105984.
The previous prime is 311716061. The next prime is 311716081. The reversal of 311716080 is 80617113.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311716081) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 477034 + ... + 477686.
It is an arithmetic number, because the mean of its divisors is an integer number (3831786).
Almost surely, 2311716080 is an apocalyptic number.
311716080 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 311716080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (613085760).
311716080 is an abundant number, since it is smaller than the sum of its proper divisors (914455440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
311716080 is a wasteful number, since it uses less digits than its factorization.
311716080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 705 (or 693 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 311716080 is about 17655.4830010396. The cubic root of 311716080 is about 678.0364926712.
The spelling of 311716080 in words is "three hundred eleven million, seven hundred sixteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •