Base | Representation |
---|---|
bin | 10010110111100… |
… | …000110000000000 |
3 | 211001121222221000 |
4 | 102313200300000 |
5 | 1122013320302 |
6 | 51224332000 |
7 | 10562363556 |
oct | 2267406000 |
9 | 731558830 |
10 | 316541952 |
11 | 152752721 |
12 | 8a014000 |
13 | 5077023c |
14 | 3007bbd6 |
15 | 1cbca31c |
hex | 12de0c00 |
316541952 has 132 divisors (see below), whose sum is σ = 946287160. Its totient is φ = 104527872.
The previous prime is 316541947. The next prime is 316541971. The reversal of 316541952 is 259145613.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2958283 + ... + 2958389.
Almost surely, 2316541952 is an apocalyptic number.
316541952 is a gapful number since it is divisible by the number (32) 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 316541952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (473143580).
316541952 is an abundant number, since it is smaller than the sum of its proper divisors (629745208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
316541952 is an equidigital number, since it uses as much as digits as its factorization.
316541952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243 (or 112 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The square root of 316541952 is about 17791.6258953475. The cubic root of 316541952 is about 681.5176254349.
The spelling of 316541952 in words is "three hundred sixteen million, five hundred forty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •