Base | Representation |
---|---|
bin | 110010110101… |
… | …001010100001 |
3 | 221001222102002 |
4 | 302311022201 |
5 | 11402344321 |
6 | 1153333345 |
7 | 221155166 |
oct | 62651241 |
9 | 27058362 |
10 | 13324961 |
11 | 7581271 |
12 | 4567255 |
13 | 29b70c0 |
14 | 1aac06d |
15 | 128320b |
hex | cb52a1 |
13324961 has 4 divisors (see below), whose sum is σ = 14349972. Its totient is φ = 12299952.
The previous prime is 13324943. The next prime is 13324999. The reversal of 13324961 is 16942331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16942331 = 7 ⋅2420333.
It can be written as a sum of positive squares in 2 ways, for example, as 2560000 + 10764961 = 1600^2 + 3281^2 .
It is a cyclic number.
It is not a de Polignac number, because 13324961 - 222 = 9130657 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13324931) 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, 512486 + ... + 512511.
It is an arithmetic number, because the mean of its divisors is an integer number (3587493).
Almost surely, 213324961 is an apocalyptic number.
It is an amenable number.
13324961 is a deficient number, since it is larger than the sum of its proper divisors (1025011).
13324961 is a wasteful number, since it uses less digits than its factorization.
13324961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1025010.
The product of its digits is 3888, while the sum is 29.
The square root of 13324961 is about 3650.3371077203. The cubic root of 13324961 is about 237.0765774133.
The spelling of 13324961 in words is "thirteen million, three hundred twenty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •