Base | Representation |
---|---|
bin | 1111000011000… |
… | …0000010001111 |
3 | 11101202101102222 |
4 | 3300300002033 |
5 | 112124030221 |
6 | 10132405555 |
7 | 1364302664 |
oct | 360600217 |
9 | 141671388 |
10 | 63111311 |
11 | 3269650a |
12 | 191768bb |
13 | 100c9193 |
14 | 854ba6b |
15 | 58199ab |
hex | 3c3008f |
63111311 has 2 divisors, whose sum is σ = 63111312. Its totient is φ = 63111310.
The previous prime is 63111289. The next prime is 63111313. The reversal of 63111311 is 11311136.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 63111311 - 26 = 63111247 is a prime.
It is a super-2 number, since 2×631113112 = 7966075152277442, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 63111313, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 63111311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (63111313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31555655 + 31555656.
It is an arithmetic number, because the mean of its divisors is an integer number (31555656).
Almost surely, 263111311 is an apocalyptic number.
63111311 is a deficient number, since it is larger than the sum of its proper divisors (1).
63111311 is an equidigital number, since it uses as much as digits as its factorization.
63111311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54, while the sum is 17.
The square root of 63111311 is about 7944.2627725926. The cubic root of 63111311 is about 398.1399283242.
Adding to 63111311 its reverse (11311136), we get a palindrome (74422447).
The spelling of 63111311 in words is "sixty-three million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •