Base | Representation |
---|---|
bin | 1111001000101… |
… | …0110100001101 |
3 | 11102110021111202 |
4 | 3302022310031 |
5 | 112222430044 |
6 | 10144355245 |
7 | 1400412032 |
oct | 362126415 |
9 | 142407452 |
10 | 63483149 |
11 | 3291a914 |
12 | 19315b25 |
13 | 101c94c2 |
14 | 8607389 |
15 | 588ec4e |
hex | 3c8ad0d |
63483149 has 2 divisors, whose sum is σ = 63483150. Its totient is φ = 63483148.
The previous prime is 63483139. The next prime is 63483163. The reversal of 63483149 is 94138436.
63483149 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., 62125924 + 1357225 = 7882^2 + 1165^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-63483149 is a prime.
It is a super-2 number, since 2×634831492 = 8060220413912402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (63483139) 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, 31741574 + 31741575.
It is an arithmetic number, because the mean of its divisors is an integer number (31741575).
Almost surely, 263483149 is an apocalyptic number.
It is an amenable number.
63483149 is a deficient number, since it is larger than the sum of its proper divisors (1).
63483149 is an equidigital number, since it uses as much as digits as its factorization.
63483149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 62208, while the sum is 38.
The square root of 63483149 is about 7967.6313293224. The cubic root of 63483149 is about 398.9203154084.
The spelling of 63483149 in words is "sixty-three million, four hundred eighty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •