Base | Representation |
---|---|
bin | 1001111110001110100 |
3 | 121121020200 |
4 | 1033301310 |
5 | 40424042 |
6 | 11000500 |
7 | 2530455 |
oct | 1176164 |
9 | 547220 |
10 | 326772 |
11 | 203566 |
12 | 139130 |
13 | b5974 |
14 | 8712c |
15 | 66c4c |
hex | 4fc74 |
326772 has 36 divisors (see below), whose sum is σ = 857220. Its totient is φ = 104832.
The previous prime is 326741. The next prime is 326773. The reversal of 326772 is 277623.
326772 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 60516 + 266256 = 246^2 + 516^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (326773) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 888 + ... + 1200.
2326772 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 326772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (428610).
326772 is an abundant number, since it is smaller than the sum of its proper divisors (530448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326772 is a wasteful number, since it uses less digits than its factorization.
326772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352 (or 347 counting only the distinct ones).
The product of its digits is 3528, while the sum is 27.
The square root of 326772 is about 571.6397466937. The cubic root of 326772 is about 68.8781719175.
The spelling of 326772 in words is "three hundred twenty-six thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •