Base | Representation |
---|---|
bin | 1111000111110… |
… | …1001000001001 |
3 | 11102100102121011 |
4 | 3301331020021 |
5 | 112214131311 |
6 | 10143243521 |
7 | 1400056414 |
oct | 361751011 |
9 | 142312534 |
10 | 63427081 |
11 | 32891783 |
12 | 192a95a1 |
13 | 101a9b23 |
14 | 85d0b7b |
15 | 587d321 |
hex | 3c7d209 |
63427081 has 2 divisors, whose sum is σ = 63427082. Its totient is φ = 63427080.
The previous prime is 63427079. The next prime is 63427093. The reversal of 63427081 is 18072436.
63427081 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., 60918025 + 2509056 = 7805^2 + 1584^2 .
It is a cyclic number.
It is not a de Polignac number, because 63427081 - 21 = 63427079 is a prime.
It is a super-2 number, since 2×634270812 = 8045989208361122, which contains 22 as substring.
Together with 63427079, 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 (63421081) 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, 31713540 + 31713541.
It is an arithmetic number, because the mean of its divisors is an integer number (31713541).
Almost surely, 263427081 is an apocalyptic number.
It is an amenable number.
63427081 is a deficient number, since it is larger than the sum of its proper divisors (1).
63427081 is an equidigital number, since it uses as much as digits as its factorization.
63427081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
The square root of 63427081 is about 7964.1120660121. The cubic root of 63427081 is about 398.8028393404.
The spelling of 63427081 in words is "sixty-three million, four hundred twenty-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •