Base | Representation |
---|---|
bin | 10010111010010… |
… | …000011000000000 |
3 | 211002222112200222 |
4 | 102322100120000 |
5 | 1122204330222 |
6 | 51252002212 |
7 | 10601451044 |
oct | 2272203000 |
9 | 732875628 |
10 | 317261312 |
11 | 1530a4135 |
12 | 8a300368 |
13 | 509627b4 |
14 | 301c8024 |
15 | 1ccbd542 |
hex | 12e90600 |
317261312 has 40 divisors (see below), whose sum is σ = 638671176. Its totient is φ = 157437952.
The previous prime is 317261311. The next prime is 317261323. The reversal of 317261312 is 213162713.
It is a super-2 number, since 2×3172613122 = 201309480183922688, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (317261311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67883 + ... + 72405.
Almost surely, 2317261312 is an apocalyptic number.
317261312 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 317261312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (319335588).
317261312 is an abundant number, since it is smaller than the sum of its proper divisors (321409864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
317261312 is an equidigital number, since it uses as much as digits as its factorization.
317261312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4678 (or 4662 counting only the distinct ones).
The product of its digits is 1512, while the sum is 26.
The square root of 317261312 is about 17811.8306751440. The cubic root of 317261312 is about 682.0334976653.
The spelling of 317261312 in words is "three hundred seventeen million, two hundred sixty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •