Base | Representation |
---|---|
bin | 1111100110111… |
… | …0001100001000 |
3 | 11120011212102100 |
4 | 3321232030020 |
5 | 113224304143 |
6 | 10255033400 |
7 | 1423266240 |
oct | 371561410 |
9 | 146155370 |
10 | 65463048 |
11 | 33a523a2 |
12 | 19b0b860 |
13 | 10740741 |
14 | 89a0b20 |
15 | 5b316d3 |
hex | 3e6e308 |
65463048 has 48 divisors (see below), whose sum is σ = 202625280. Its totient is φ = 18703584.
The previous prime is 65463043. The next prime is 65463053. The reversal of 65463048 is 84036456.
65463048 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (65463043) and next prime (65463053).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (65463043) 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 in 11 ways as a sum of consecutive naturals, for example, 64440 + ... + 65447.
It is an arithmetic number, because the mean of its divisors is an integer number (4221360).
Almost surely, 265463048 is an apocalyptic number.
It is an amenable number.
65463048 is an abundant number, since it is smaller than the sum of its proper divisors (137162232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65463048 is a wasteful number, since it uses less digits than its factorization.
65463048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129906 (or 129899 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The square root of 65463048 is about 8090.9238038681. The cubic root of 65463048 is about 403.0250812033.
The spelling of 65463048 in words is "sixty-five million, four hundred sixty-three thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •