Base | Representation |
---|---|
bin | 110010010111… |
… | …001010000101 |
3 | 220211201210221 |
4 | 302113022011 |
5 | 11334431203 |
6 | 1150544341 |
7 | 220133644 |
oct | 62271205 |
9 | 26751727 |
10 | 13202053 |
11 | 74a7997 |
12 | 45080b1 |
13 | 2973187 |
14 | 1a7935b |
15 | 125babd |
hex | c97285 |
13202053 has 4 divisors (see below), whose sum is σ = 13212108. Its totient is φ = 13192000.
The previous prime is 13202051. The next prime is 13202107. The reversal of 13202053 is 35020231.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 1216609 + 11985444 = 1103^2 + 3462^2 .
It is a cyclic number.
It is not a de Polignac number, because 13202053 - 21 = 13202051 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 (13202051) 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, 2698 + ... + 5803.
It is an arithmetic number, because the mean of its divisors is an integer number (3303027).
Almost surely, 213202053 is an apocalyptic number.
It is an amenable number.
13202053 is a deficient number, since it is larger than the sum of its proper divisors (10055).
13202053 is an equidigital number, since it uses as much as digits as its factorization.
13202053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10054.
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 13202053 is about 3633.4629487584. The cubic root of 13202053 is about 236.3454017805.
Adding to 13202053 its reverse (35020231), we get a palindrome (48222284).
The spelling of 13202053 in words is "thirteen million, two hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •