Base | Representation |
---|---|
bin | 1100011110110… |
… | …0110010100001 |
3 | 10122111122212002 |
4 | 3013230302201 |
5 | 101400200423 |
6 | 5110013345 |
7 | 1203653144 |
oct | 307546241 |
9 | 118448762 |
10 | 52350113 |
11 | 27606462 |
12 | 15647255 |
13 | aacbcca |
14 | 6d4a05b |
15 | 48e1228 |
hex | 31ecca1 |
52350113 has 2 divisors, whose sum is σ = 52350114. Its totient is φ = 52350112.
The previous prime is 52350101. The next prime is 52350143. The reversal of 52350113 is 31105325.
52350113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30382144 + 21967969 = 5512^2 + 4687^2 .
It is a cyclic number.
It is not a de Polignac number, because 52350113 - 24 = 52350097 is a prime.
It is a super-2 number, since 2×523501132 = 5481068662225538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (52350143) 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 as a sum of consecutive naturals, namely, 26175056 + 26175057.
It is an arithmetic number, because the mean of its divisors is an integer number (26175057).
Almost surely, 252350113 is an apocalyptic number.
It is an amenable number.
52350113 is a deficient number, since it is larger than the sum of its proper divisors (1).
52350113 is an equidigital number, since it uses as much as digits as its factorization.
52350113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 52350113 is about 7235.3377944641. The cubic root of 52350113 is about 374.0869353798.
Adding to 52350113 its reverse (31105325), we get a palindrome (83455438).
The spelling of 52350113 in words is "fifty-two million, three hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •