Base | Representation |
---|---|
bin | 110010000100… |
… | …101001101101 |
3 | 220200212211112 |
4 | 302010221231 |
5 | 11330020003 |
6 | 1145201405 |
7 | 216366650 |
oct | 62045155 |
9 | 26625745 |
10 | 13126253 |
11 | 7455a48 |
12 | 4490265 |
13 | 294781a |
14 | 1a59897 |
15 | 12443d8 |
hex | c84a6d |
13126253 has 4 divisors (see below), whose sum is σ = 15001440. Its totient is φ = 11251068.
The previous prime is 13126219. The next prime is 13126259. The reversal of 13126253 is 35262131.
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, and also an emirpimes, since its reverse is a distinct semiprime: 35262131 = 17 ⋅2074243.
It is a cyclic number.
It is not a de Polignac number, because 13126253 - 26 = 13126189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13126259) 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, 937583 + ... + 937596.
It is an arithmetic number, because the mean of its divisors is an integer number (3750360).
Almost surely, 213126253 is an apocalyptic number.
It is an amenable number.
13126253 is a deficient number, since it is larger than the sum of its proper divisors (1875187).
13126253 is an equidigital number, since it uses as much as digits as its factorization.
13126253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1875186.
The product of its digits is 1080, while the sum is 23.
The square root of 13126253 is about 3623.0171128495. The cubic root of 13126253 is about 235.8922051523.
Adding to 13126253 its reverse (35262131), we get a palindrome (48388384).
The spelling of 13126253 in words is "thirteen million, one hundred twenty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •