Base | Representation |
---|---|
bin | 110011100111… |
… | …110100000101 |
3 | 221110111222210 |
4 | 303213310011 |
5 | 11431014141 |
6 | 1202014033 |
7 | 223011060 |
oct | 63476405 |
9 | 27414883 |
10 | 13532421 |
11 | 7703121 |
12 | 4647319 |
13 | 2a5a666 |
14 | 1b238d7 |
15 | 12c4916 |
hex | ce7d05 |
13532421 has 8 divisors (see below), whose sum is σ = 20620864. Its totient is φ = 7732800.
The previous prime is 13532377. The next prime is 13532429. The reversal of 13532421 is 12423531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13532421 - 211 = 13530373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 644401 = 13532421 / (1 + 3 + 5 + 3 + 2 + 4 + 2 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13532429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 322180 + ... + 322221.
It is an arithmetic number, because the mean of its divisors is an integer number (2577608).
Almost surely, 213532421 is an apocalyptic number.
It is an amenable number.
13532421 is a deficient number, since it is larger than the sum of its proper divisors (7088443).
13532421 is an equidigital number, since it uses as much as digits as its factorization.
13532421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644411.
The product of its digits is 720, while the sum is 21.
The square root of 13532421 is about 3678.6439077464. The cubic root of 13532421 is about 238.3006170011.
Adding to 13532421 its reverse (12423531), we get a palindrome (25955952).
The spelling of 13532421 in words is "thirteen million, five hundred thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •