Base | Representation |
---|---|
bin | 1111000010111… |
… | …0110100010001 |
3 | 11101202010121011 |
4 | 3300232310101 |
5 | 112123400241 |
6 | 10132330521 |
7 | 1364252305 |
oct | 360566421 |
9 | 141663534 |
10 | 63106321 |
11 | 32692793 |
12 | 19173a41 |
13 | 100c6b25 |
14 | 8549d05 |
15 | 5818281 |
hex | 3c2ed11 |
63106321 has 2 divisors, whose sum is σ = 63106322. Its totient is φ = 63106320.
The previous prime is 63106301. The next prime is 63106333. The reversal of 63106321 is 12360136.
63106321 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., 54760000 + 8346321 = 7400^2 + 2889^2 .
It is a cyclic number.
It is not a de Polignac number, because 63106321 - 211 = 63104273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 63106292 and 63106301.
It is not a weakly prime, because it can be changed into another prime (63106301) 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, 31553160 + 31553161.
It is an arithmetic number, because the mean of its divisors is an integer number (31553161).
Almost surely, 263106321 is an apocalyptic number.
It is an amenable number.
63106321 is a deficient number, since it is larger than the sum of its proper divisors (1).
63106321 is an equidigital number, since it uses as much as digits as its factorization.
63106321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 63106321 is about 7943.9487032583. The cubic root of 63106321 is about 398.1294348508.
Adding to 63106321 its reverse (12360136), we get a palindrome (75466457).
The spelling of 63106321 in words is "sixty-three million, one hundred six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •