Base | Representation |
---|---|
bin | 10010111010100… |
… | …000111100000000 |
3 | 211010002222202120 |
4 | 102322200330000 |
5 | 1122214013102 |
6 | 51253244240 |
7 | 10602152610 |
oct | 2272407400 |
9 | 733088676 |
10 | 317329152 |
11 | 1531400a8 |
12 | 8a333680 |
13 | 5098763a |
14 | 30204a40 |
15 | 1ccd36bc |
hex | 12ea0f00 |
317329152 has 144 divisors (see below), whose sum is σ = 980727552. Its totient is φ = 89210880.
The previous prime is 317329147. The next prime is 317329163. The reversal of 317329152 is 251923713.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 359752 + ... + 360632.
It is an arithmetic number, because the mean of its divisors is an integer number (6810608).
Almost surely, 2317329152 is an apocalyptic number.
317329152 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 317329152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (490363776).
317329152 is an abundant number, since it is smaller than the sum of its proper divisors (663398400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
317329152 is an equidigital number, since it uses as much as digits as its factorization.
317329152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 974 (or 960 counting only the distinct ones).
The product of its digits is 11340, while the sum is 33.
The square root of 317329152 is about 17813.7349256129. The cubic root of 317329152 is about 682.0821072847.
The spelling of 317329152 in words is "three hundred seventeen million, three hundred twenty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •