Base | Representation |
---|---|
bin | 1100011100111… |
… | …0100000110101 |
3 | 10122021100202001 |
4 | 3013032200311 |
5 | 101332213401 |
6 | 5103215301 |
7 | 1202625454 |
oct | 307164065 |
9 | 118240661 |
10 | 52226101 |
11 | 27531274 |
12 | 155a7531 |
13 | aa87725 |
14 | 6d16b9b |
15 | 48b9601 |
hex | 31ce835 |
52226101 has 2 divisors, whose sum is σ = 52226102. Its totient is φ = 52226100.
The previous prime is 52226099. The next prime is 52226113. The reversal of 52226101 is 10162225.
52226101 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., 52215076 + 11025 = 7226^2 + 105^2 .
It is a cyclic number.
It is not a de Polignac number, because 52226101 - 21 = 52226099 is a prime.
Together with 52226099, 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 (52226131) 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, 26113050 + 26113051.
It is an arithmetic number, because the mean of its divisors is an integer number (26113051).
Almost surely, 252226101 is an apocalyptic number.
It is an amenable number.
52226101 is a deficient number, since it is larger than the sum of its proper divisors (1).
52226101 is an equidigital number, since it uses as much as digits as its factorization.
52226101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 52226101 is about 7226.7628299260. The cubic root of 52226101 is about 373.7913107434.
Adding to 52226101 its reverse (10162225), we get a palindrome (62388326).
The spelling of 52226101 in words is "fifty-two million, two hundred twenty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •