Base | Representation |
---|---|
bin | 1111000010000… |
… | …1101100111001 |
3 | 11101122101220112 |
4 | 3300201230321 |
5 | 112120140401 |
6 | 10131234105 |
7 | 1363636553 |
oct | 360415471 |
9 | 141571815 |
10 | 63052601 |
11 | 32656397 |
12 | 19148935 |
13 | 100a8541 |
14 | 85344d3 |
15 | 58073bb |
hex | 3c21b39 |
63052601 has 2 divisors, whose sum is σ = 63052602. Its totient is φ = 63052600.
The previous prime is 63052529. The next prime is 63052603. The reversal of 63052601 is 10625036.
63052601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41938576 + 21114025 = 6476^2 + 4595^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63052601 is a prime.
Together with 63052603, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (63052603) 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, 31526300 + 31526301.
It is an arithmetic number, because the mean of its divisors is an integer number (31526301).
Almost surely, 263052601 is an apocalyptic number.
It is an amenable number.
63052601 is a deficient number, since it is larger than the sum of its proper divisors (1).
63052601 is an equidigital number, since it uses as much as digits as its factorization.
63052601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 63052601 is about 7940.5667933719. The cubic root of 63052601 is about 398.0164319874.
Adding to 63052601 its reverse (10625036), we get a palindrome (73677637).
The spelling of 63052601 in words is "sixty-three million, fifty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •