Base | Representation |
---|---|
bin | 1100011010110… |
… | …0111000010101 |
3 | 10122000100202211 |
4 | 3012230320111 |
5 | 101313311331 |
6 | 5100233421 |
7 | 1201513024 |
oct | 306547025 |
9 | 118010684 |
10 | 52088341 |
11 | 27447818 |
12 | 1553b871 |
13 | aa39b06 |
14 | 6cbc8bb |
15 | 488d8b1 |
hex | 31ace15 |
52088341 has 4 divisors (see below), whose sum is σ = 53496172. Its totient is φ = 50680512.
The previous prime is 52088303. The next prime is 52088371. The reversal of 52088341 is 14388025.
52088341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27783441 + 24304900 = 5271^2 + 4930^2 .
It is a cyclic number.
It is not a de Polignac number, because 52088341 - 27 = 52088213 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 (52088371) 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, 703860 + ... + 703933.
It is an arithmetic number, because the mean of its divisors is an integer number (13374043).
Almost surely, 252088341 is an apocalyptic number.
It is an amenable number.
52088341 is a deficient number, since it is larger than the sum of its proper divisors (1407831).
52088341 is a wasteful number, since it uses less digits than its factorization.
52088341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1407830.
The product of its (nonzero) digits is 7680, while the sum is 31.
The square root of 52088341 is about 7217.2252978551. The cubic root of 52088341 is about 373.4623638995.
The spelling of 52088341 in words is "fifty-two million, eighty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •