Base | Representation |
---|---|
bin | 10011000101111… |
… | …111111100000000 |
3 | 211022202221110210 |
4 | 103011333330000 |
5 | 1124001332322 |
6 | 51441554120 |
7 | 10636562010 |
oct | 2305777400 |
9 | 738687423 |
10 | 320339712 |
11 | 154906a70 |
12 | 8b345940 |
13 | 5149ca34 |
14 | 30789c40 |
15 | 1d1ca70c |
hex | 1317ff00 |
320339712 has 144 divisors (see below), whose sum is σ = 1063141632. Its totient is φ = 83189760.
The previous prime is 320339651. The next prime is 320339729. The reversal of 320339712 is 217933023.
It is a self number, because there is not a number n which added to its sum of digits gives 320339712.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56428 + ... + 61844.
It is an arithmetic number, because the mean of its divisors is an integer number (7382928).
Almost surely, 2320339712 is an apocalyptic number.
320339712 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 320339712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (531570816).
320339712 is an abundant number, since it is smaller than the sum of its proper divisors (742801920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
320339712 is a wasteful number, since it uses less digits than its factorization.
320339712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5454 (or 5440 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 30.
The square root of 320339712 is about 17898.0365403583. The cubic root of 320339712 is about 684.2323344661.
The spelling of 320339712 in words is "three hundred twenty million, three hundred thirty-nine thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •