Base | Representation |
---|---|
bin | 110001110010… |
… | …101001110011 |
3 | 220120010201002 |
4 | 301302221303 |
5 | 11320140111 |
6 | 1143432215 |
7 | 215642012 |
oct | 61625163 |
9 | 26503632 |
10 | 13052531 |
11 | 7405618 |
12 | 445566b |
13 | 29200bb |
14 | 1a3aa79 |
15 | 122c63b |
hex | c72a73 |
13052531 has 4 divisors (see below), whose sum is σ = 13071072. Its totient is φ = 13033992.
The previous prime is 13052513. The next prime is 13052537. The reversal of 13052531 is 13525031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13525031 = 13 ⋅1040387.
It is a cyclic number.
It is not a de Polignac number, because 13052531 - 26 = 13052467 is a prime.
It is a super-2 number, since 2×130525312 = 340737131011922, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 12.
It is not an unprimeable number, because it can be changed into a prime (13052537) 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, 8171 + ... + 9636.
It is an arithmetic number, because the mean of its divisors is an integer number (3267768).
Almost surely, 213052531 is an apocalyptic number.
13052531 is a deficient number, since it is larger than the sum of its proper divisors (18541).
13052531 is an equidigital number, since it uses as much as digits as its factorization.
13052531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18540.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 13052531 is about 3612.8286701697. The cubic root of 13052531 is about 235.4497558557.
Adding to 13052531 its reverse (13525031), we get a palindrome (26577562).
The spelling of 13052531 in words is "thirteen million, fifty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •