Base | Representation |
---|---|
bin | 1111101000010… |
… | …0001011101100 |
3 | 11120100102222210 |
4 | 3322010023230 |
5 | 113240200012 |
6 | 10301010420 |
7 | 1424123001 |
oct | 372041354 |
9 | 146312883 |
10 | 65553132 |
11 | 34004047 |
12 | 19b53a10 |
13 | 10772748 |
14 | 89c58a8 |
15 | 5b4d23c |
hex | 3e842ec |
65553132 has 24 divisors (see below), whose sum is σ = 153807472. Its totient is φ = 21729600.
The previous prime is 65553121. The next prime is 65553133. The reversal of 65553132 is 23135556.
65553132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 65553132.
It is not an unprimeable number, because it can be changed into a prime (65553133) 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 7 ways as a sum of consecutive naturals, for example, 12919 + ... + 17262.
Almost surely, 265553132 is an apocalyptic number.
It is an amenable number.
65553132 is an abundant number, since it is smaller than the sum of its proper divisors (88254340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65553132 is a wasteful number, since it uses less digits than its factorization.
65553132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30369 (or 30367 counting only the distinct ones).
The product of its digits is 13500, while the sum is 30.
The square root of 65553132 is about 8096.4888686393. The cubic root of 65553132 is about 403.2098646884.
Adding to 65553132 its reverse (23135556), we get a palindrome (88688688).
The spelling of 65553132 in words is "sixty-five million, five hundred fifty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •