Base | Representation |
---|---|
bin | 110010101001… |
… | …000000000001 |
3 | 220222110001202 |
4 | 302221000001 |
5 | 11344301022 |
6 | 1152310545 |
7 | 220560011 |
oct | 62510001 |
9 | 26873052 |
10 | 13275137 |
11 | 7547897 |
12 | 4542455 |
13 | 299a515 |
14 | 1a97c41 |
15 | 1273592 |
hex | ca9001 |
13275137 has 4 divisors (see below), whose sum is σ = 13406676. Its totient is φ = 13143600.
The previous prime is 13275131. The next prime is 13275203. The reversal of 13275137 is 73157231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73157231 = 7 ⋅10451033.
It can be written as a sum of positive squares in 2 ways, for example, as 10233601 + 3041536 = 3199^2 + 1744^2 .
It is a cyclic number.
It is not a de Polignac number, because 13275137 - 24 = 13275121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13275131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65618 + ... + 65819.
It is an arithmetic number, because the mean of its divisors is an integer number (3351669).
It is a Proth number, since it is equal to 3241 ⋅ 212 + 1 and 3241 < 212.
Almost surely, 213275137 is an apocalyptic number.
It is an amenable number.
13275137 is a deficient number, since it is larger than the sum of its proper divisors (131539).
13275137 is a wasteful number, since it uses less digits than its factorization.
13275137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131538.
The product of its digits is 4410, while the sum is 29.
The square root of 13275137 is about 3643.5061410680. The cubic root of 13275137 is about 236.7807202258.
The spelling of 13275137 in words is "thirteen million, two hundred seventy-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •