Base | Representation |
---|---|
bin | 1111101001111… |
… | …1110100011000 |
3 | 11120120012021020 |
4 | 3322133310120 |
5 | 113302310303 |
6 | 10303242440 |
7 | 1425104010 |
oct | 372376430 |
9 | 146505236 |
10 | 65666328 |
11 | 340810a2 |
12 | 19ba9420 |
13 | 107b2120 |
14 | 8a14c40 |
15 | 5b71a53 |
hex | 3e9fd18 |
65666328 has 128 divisors (see below), whose sum is σ = 204664320. Its totient is φ = 17095680.
The previous prime is 65666323. The next prime is 65666371. The reversal of 65666328 is 82366656.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 65666328.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65666323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 233548 + ... + 233828.
It is an arithmetic number, because the mean of its divisors is an integer number (1598940).
Almost surely, 265666328 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65666328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102332160).
65666328 is an abundant number, since it is smaller than the sum of its proper divisors (138997992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65666328 is a wasteful number, since it uses less digits than its factorization.
65666328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 417 (or 413 counting only the distinct ones).
The product of its digits is 311040, while the sum is 42.
The square root of 65666328 is about 8103.4762910741. The cubic root of 65666328 is about 403.4418164732.
The spelling of 65666328 in words is "sixty-five million, six hundred sixty-six thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •