Base | Representation |
---|---|
bin | 1100011001100… |
… | …1000010111101 |
3 | 10121212020022221 |
4 | 3012121002331 |
5 | 101303211401 |
6 | 5054405341 |
7 | 1201024126 |
oct | 306310275 |
9 | 117766287 |
10 | 52007101 |
11 | 273a1783 |
12 | 15500851 |
13 | aa0bb43 |
14 | 6c9b04d |
15 | 48747a1 |
hex | 31990bd |
52007101 has 2 divisors, whose sum is σ = 52007102. Its totient is φ = 52007100.
The previous prime is 52007099. The next prime is 52007107. The reversal of 52007101 is 10170025.
52007101 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., 48580900 + 3426201 = 6970^2 + 1851^2 .
It is a cyclic number.
It is not a de Polignac number, because 52007101 - 21 = 52007099 is a prime.
Together with 52007099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52007107) 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, 26003550 + 26003551.
It is an arithmetic number, because the mean of its divisors is an integer number (26003551).
Almost surely, 252007101 is an apocalyptic number.
It is an amenable number.
52007101 is a deficient number, since it is larger than the sum of its proper divisors (1).
52007101 is an equidigital number, since it uses as much as digits as its factorization.
52007101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70, while the sum is 16.
The square root of 52007101 is about 7211.5948998817. The cubic root of 52007101 is about 373.2681050121.
Adding to 52007101 its reverse (10170025), we get a palindrome (62177126).
The spelling of 52007101 in words is "fifty-two million, seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •