Base | Representation |
---|---|
bin | 1100011110110… |
… | …0000000011111 |
3 | 10122111111110111 |
4 | 3013230000133 |
5 | 101400100121 |
6 | 5105550451 |
7 | 1203640621 |
oct | 307540037 |
9 | 118444414 |
10 | 52346911 |
11 | 27604011 |
12 | 15645427 |
13 | aaca706 |
14 | 6d48c11 |
15 | 48e02e1 |
hex | 31ec01f |
52346911 has 4 divisors (see below), whose sum is σ = 52810272. Its totient is φ = 51883552.
The previous prime is 52346909. The next prime is 52346929. The reversal of 52346911 is 11964325.
52346911 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 is a cyclic number.
It is not a de Polignac number, because 52346911 - 21 = 52346909 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52346981) 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, 231511 + ... + 231736.
It is an arithmetic number, because the mean of its divisors is an integer number (13202568).
Almost surely, 252346911 is an apocalyptic number.
52346911 is a deficient number, since it is larger than the sum of its proper divisors (463361).
52346911 is a wasteful number, since it uses less digits than its factorization.
52346911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463360.
The product of its digits is 6480, while the sum is 31.
The square root of 52346911 is about 7235.1165159934. The cubic root of 52346911 is about 374.0793082024.
The spelling of 52346911 in words is "fifty-two million, three hundred forty-six thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •