Base | Representation |
---|---|
bin | 10011100100010… |
… | …000101100000110 |
3 | 211212200222102011 |
4 | 103210100230012 |
5 | 1133014211041 |
6 | 52324004434 |
7 | 11064162052 |
oct | 2344205406 |
9 | 755628364 |
10 | 328272646 |
11 | 159335109 |
12 | 91b3071a |
13 | 53019790 |
14 | 31852c62 |
15 | 1dc45e81 |
hex | 13910b06 |
328272646 has 8 divisors (see below), whose sum is σ = 530286624. Its totient is φ = 151510440.
The previous prime is 328272643. The next prime is 328272649. The reversal of 328272646 is 646272823.
It is an interprime number because it is at equal distance from previous prime (328272643) and next prime (328272649).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×3282726462 = 215525860223682632, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 328272599 and 328272608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (328272643) 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 3 ways as a sum of consecutive naturals, for example, 6312910 + ... + 6312961.
It is an arithmetic number, because the mean of its divisors is an integer number (66285828).
Almost surely, 2328272646 is an apocalyptic number.
328272646 is a deficient number, since it is larger than the sum of its proper divisors (202013978).
328272646 is a wasteful number, since it uses less digits than its factorization.
328272646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12625886.
The product of its digits is 193536, while the sum is 40.
The square root of 328272646 is about 18118.2958911703. The cubic root of 328272646 is about 689.8344810570.
The spelling of 328272646 in words is "three hundred twenty-eight million, two hundred seventy-two thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •