Base | Representation |
---|---|
bin | 1100011010110… |
… | …1100001001101 |
3 | 10122000111100201 |
4 | 3012231201031 |
5 | 101313402312 |
6 | 5100253501 |
7 | 1201523452 |
oct | 306554115 |
9 | 118014321 |
10 | 52090957 |
11 | 27449786 |
12 | 15541291 |
13 | aa3b069 |
14 | 6cbd829 |
15 | 488e557 |
hex | 31ad84d |
52090957 has 4 divisors (see below), whose sum is σ = 52111836. Its totient is φ = 52070080.
The previous prime is 52090949. The next prime is 52090979. The reversal of 52090957 is 75909025.
52090957 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 32959081 + 19131876 = 5741^2 + 4374^2 .
It is a cyclic number.
It is not a de Polignac number, because 52090957 - 23 = 52090949 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 (52090657) 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, 6094 + ... + 11887.
It is an arithmetic number, because the mean of its divisors is an integer number (13027959).
Almost surely, 252090957 is an apocalyptic number.
It is an amenable number.
52090957 is a deficient number, since it is larger than the sum of its proper divisors (20879).
52090957 is a wasteful number, since it uses less digits than its factorization.
52090957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20878.
The product of its (nonzero) digits is 28350, while the sum is 37.
The square root of 52090957 is about 7217.4065286639. The cubic root of 52090957 is about 373.4686158500.
The spelling of 52090957 in words is "fifty-two million, ninety thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •