Base | Representation |
---|---|
bin | 10010111000011… |
… | …000011100000000 |
3 | 211002001120211000 |
4 | 102320120130000 |
5 | 1122043120143 |
6 | 51233252000 |
7 | 10564333560 |
oct | 2270303400 |
9 | 732046730 |
10 | 316770048 |
11 | 152899031 |
12 | 8a104000 |
13 | 5081ccca |
14 | 300dada0 |
15 | 1cc22bd3 |
hex | 12e18700 |
316770048 has 144 divisors (see below), whose sum is σ = 1070728960. Its totient is φ = 90491904.
The previous prime is 316770043. The next prime is 316770049. The reversal of 316770048 is 840077613.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 316769994 and 316770021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (316770043) 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, 45111 + ... + 51657.
Almost surely, 2316770048 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 316770048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (535364480).
316770048 is an abundant number, since it is smaller than the sum of its proper divisors (753958912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
316770048 is an equidigital number, since it uses as much as digits as its factorization.
316770048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6579 (or 6559 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 36.
The square root of 316770048 is about 17798.0349477126. The cubic root of 316770048 is about 681.6812837004.
The spelling of 316770048 in words is "three hundred sixteen million, seven hundred seventy thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •