Base | Representation |
---|---|
bin | 1100100011011… |
… | …0001111010001 |
3 | 10200001221112121 |
4 | 3020312033101 |
5 | 101434312321 |
6 | 5120254241 |
7 | 1206345226 |
oct | 310661721 |
9 | 120057477 |
10 | 52650961 |
11 | 277a14a0 |
12 | 15771381 |
13 | aba5c1c |
14 | 6dc794d |
15 | 4950441 |
hex | 32363d1 |
52650961 has 4 divisors (see below), whose sum is σ = 57437424. Its totient is φ = 47864500.
The previous prime is 52650959. The next prime is 52651003. The reversal of 52650961 is 16905625.
It is a happy number.
52650961 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 a cyclic number.
It is not a de Polignac number, because 52650961 - 21 = 52650959 is a prime.
It is not an unprimeable number, because it can be changed into a prime (52650901) 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, 2393215 + ... + 2393236.
It is an arithmetic number, because the mean of its divisors is an integer number (14359356).
Almost surely, 252650961 is an apocalyptic number.
It is an amenable number.
52650961 is a deficient number, since it is larger than the sum of its proper divisors (4786463).
52650961 is a wasteful number, since it uses less digits than its factorization.
52650961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4786462.
The product of its (nonzero) digits is 16200, while the sum is 34.
The square root of 52650961 is about 7256.0981939332. The cubic root of 52650961 is about 374.8021735835.
The spelling of 52650961 in words is "fifty-two million, six hundred fifty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •