Base | Representation |
---|---|
bin | 1100011001111… |
… | …0000101110001 |
3 | 10121220021200010 |
4 | 3012132011301 |
5 | 101304342021 |
6 | 5055045133 |
7 | 1201141302 |
oct | 306360561 |
9 | 117807603 |
10 | 52027761 |
11 | 27406255 |
12 | 155107a9 |
13 | aa18376 |
14 | 6ca47a9 |
15 | 487a976 |
hex | 319e171 |
52027761 has 4 divisors (see below), whose sum is σ = 69370352. Its totient is φ = 34685172.
The previous prime is 52027753. The next prime is 52027763. The reversal of 52027761 is 16772025.
52027761 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 52027761 - 23 = 52027753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52027763) 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, 8671291 + ... + 8671296.
It is an arithmetic number, because the mean of its divisors is an integer number (17342588).
Almost surely, 252027761 is an apocalyptic number.
It is an amenable number.
52027761 is a deficient number, since it is larger than the sum of its proper divisors (17342591).
52027761 is a wasteful number, since it uses less digits than its factorization.
52027761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17342590.
The product of its (nonzero) digits is 5880, while the sum is 30.
The square root of 52027761 is about 7213.0271731084. The cubic root of 52027761 is about 373.3175258152.
Adding to 52027761 its reverse (16772025), we get a palindrome (68799786).
The spelling of 52027761 in words is "fifty-two million, twenty-seven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •