Base | Representation |
---|---|
bin | 110010100011… |
… | …010110101101 |
3 | 220221021100022 |
4 | 302203112231 |
5 | 11343031023 |
6 | 1152011525 |
7 | 220432415 |
oct | 62432655 |
9 | 26837308 |
10 | 13252013 |
11 | 7531485 |
12 | 4530ba5 |
13 | 298cb38 |
14 | 1a8d645 |
15 | 126b7c8 |
hex | ca35ad |
13252013 has 4 divisors (see below), whose sum is σ = 13419840. Its totient is φ = 13084188.
The previous prime is 13251989. The next prime is 13252039. The reversal of 13252013 is 31025231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13252013 - 210 = 13250989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13251982 and 13252000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13252313) 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 3 ways as a sum of consecutive naturals, for example, 83795 + ... + 83952.
It is an arithmetic number, because the mean of its divisors is an integer number (3354960).
Almost surely, 213252013 is an apocalyptic number.
It is an amenable number.
13252013 is a deficient number, since it is larger than the sum of its proper divisors (167827).
13252013 is an equidigital number, since it uses as much as digits as its factorization.
13252013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167826.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 13252013 is about 3640.3314409542. The cubic root of 13252013 is about 236.6431573112.
Adding to 13252013 its reverse (31025231), we get a palindrome (44277244).
The spelling of 13252013 in words is "thirteen million, two hundred fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •