Base | Representation |
---|---|
bin | 101000100010011000001 |
3 | 2111111010002 |
4 | 11010103001 |
5 | 320001241 |
6 | 44245345 |
7 | 14201441 |
oct | 5042301 |
9 | 2444102 |
10 | 1328321 |
11 | 827a95 |
12 | 540855 |
13 | 3767b7 |
14 | 268121 |
15 | 1b389b |
hex | 1444c1 |
1328321 has 4 divisors (see below), whose sum is σ = 1330644. Its totient is φ = 1326000.
The previous prime is 1328317. The next prime is 1328323. The reversal of 1328321 is 1238231.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1238231 = 1031 ⋅1201.
It can be written as a sum of positive squares in 2 ways, for example, as 255025 + 1073296 = 505^2 + 1036^2 .
It is a cyclic number.
It is not a de Polignac number, because 1328321 - 22 = 1328317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1328293 and 1328302.
It is not an unprimeable number, because it can be changed into a prime (1328323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 371 + ... + 1671.
It is an arithmetic number, because the mean of its divisors is an integer number (332661).
21328321 is an apocalyptic number.
It is an amenable number.
1328321 is a deficient number, since it is larger than the sum of its proper divisors (2323).
1328321 is a wasteful number, since it uses less digits than its factorization.
1328321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2322.
The product of its digits is 288, while the sum is 20.
The square root of 1328321 is about 1152.5280907640. The cubic root of 1328321 is about 109.9261487764.
The spelling of 1328321 in words is "one million, three hundred twenty-eight thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •