Base | Representation |
---|---|
bin | 110010001001… |
… | …010110110101 |
3 | 220201212021022 |
4 | 302021112311 |
5 | 11331124100 |
6 | 1145430525 |
7 | 216510101 |
oct | 62112665 |
9 | 26655238 |
10 | 13145525 |
11 | 7469478 |
12 | 449b445 |
13 | 2953523 |
14 | 1a62901 |
15 | 1249e85 |
hex | c895b5 |
13145525 has 12 divisors (see below), whose sum is σ = 16414500. Its totient is φ = 10442880.
The previous prime is 13145513. The next prime is 13145527. The reversal of 13145525 is 52554131.
13145525 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 4157521 + 8988004 = 2039^2 + 2998^2 .
It is not a de Polignac number, because 13145525 - 28 = 13145269 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13145494 and 13145503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13145527) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1961 + ... + 5489.
It is an arithmetic number, because the mean of its divisors is an integer number (1367875).
Almost surely, 213145525 is an apocalyptic number.
It is an amenable number.
13145525 is a deficient number, since it is larger than the sum of its proper divisors (3268975).
13145525 is a wasteful number, since it uses less digits than its factorization.
13145525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3688 (or 3683 counting only the distinct ones).
The product of its digits is 3000, while the sum is 26.
The square root of 13145525 is about 3625.6757990753. The cubic root of 13145525 is about 236.0075945559.
Adding to 13145525 its reverse (52554131), we get a palindrome (65699656).
The spelling of 13145525 in words is "thirteen million, one hundred forty-five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •