Base | Representation |
---|---|
bin | 1111000011010… |
… | …0101101100001 |
3 | 11101210100201101 |
4 | 3300310231201 |
5 | 112130133330 |
6 | 10133034401 |
7 | 1364412556 |
oct | 360645541 |
9 | 141710641 |
10 | 63130465 |
11 | 326a9942 |
12 | 19185a01 |
13 | 10104b08 |
14 | 8554a2d |
15 | 58204ca |
hex | 3c34b61 |
63130465 has 4 divisors (see below), whose sum is σ = 75756564. Its totient is φ = 50504368.
The previous prime is 63130439. The next prime is 63130471. The reversal of 63130465 is 56403136.
63130465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17918289 + 45212176 = 4233^2 + 6724^2 .
It is a cyclic number.
It is not a de Polignac number, because 63130465 - 27 = 63130337 is a prime.
It is a super-2 number, since 2×631304652 = 7970911222232450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 6313042 + ... + 6313051.
It is an arithmetic number, because the mean of its divisors is an integer number (18939141).
Almost surely, 263130465 is an apocalyptic number.
It is an amenable number.
63130465 is a deficient number, since it is larger than the sum of its proper divisors (12626099).
63130465 is a wasteful number, since it uses less digits than its factorization.
63130465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12626098.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 63130465 is about 7945.4682052098. The cubic root of 63130465 is about 398.1802021447.
The spelling of 63130465 in words is "sixty-three million, one hundred thirty thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •