Base | Representation |
---|---|
bin | 10011100100010… |
… | …101110000111101 |
3 | 211212202000221012 |
4 | 103210111300331 |
5 | 1133020342222 |
6 | 52324245005 |
7 | 11064306503 |
oct | 2344256075 |
9 | 755660835 |
10 | 328293437 |
11 | 15934979a |
12 | 91b40765 |
13 | 53026094 |
14 | 3185a673 |
15 | 1dc4c1e2 |
hex | 13915c3d |
328293437 has 8 divisors (see below), whose sum is σ = 338449272. Its totient is φ = 318240000.
The previous prime is 328293431. The next prime is 328293439. The reversal of 328293437 is 734392823.
It can be written as a sum of positive squares in 4 ways, for example, as 9278116 + 319015321 = 3046^2 + 17861^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 328293437 - 26 = 328293373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 328293394 and 328293403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (328293431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19064 + ... + 31937.
It is an arithmetic number, because the mean of its divisors is an integer number (42306159).
Almost surely, 2328293437 is an apocalyptic number.
It is an amenable number.
328293437 is a deficient number, since it is larger than the sum of its proper divisors (10155835).
328293437 is a wasteful number, since it uses less digits than its factorization.
328293437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51199.
The product of its digits is 217728, while the sum is 41.
The square root of 328293437 is about 18118.8696391359. The cubic root of 328293437 is about 689.8490442015.
The spelling of 328293437 in words is "three hundred twenty-eight million, two hundred ninety-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •