Base | Representation |
---|---|
bin | 1111110011000… |
… | …0011111000000 |
3 | 11121200022002121 |
4 | 3330300133000 |
5 | 113430241010 |
6 | 10324054024 |
7 | 1433122402 |
oct | 374603700 |
9 | 147608077 |
10 | 66258880 |
11 | 34446306 |
12 | 1a234314 |
13 | 1095ba4c |
14 | 8b2ab72 |
15 | 5c3c3da |
hex | 3f307c0 |
66258880 has 56 divisors (see below), whose sum is σ = 159837120. Its totient is φ = 26158080.
The previous prime is 66258859. The next prime is 66258887. The reversal of 66258880 is 8885266.
It is a happy number.
66258880 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a zygodrome in base 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66258887) 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, 23970 + ... + 26590.
Almost surely, 266258880 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 66258880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79918560).
66258880 is an abundant number, since it is smaller than the sum of its proper divisors (93578240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66258880 is a wasteful number, since it uses less digits than its factorization.
66258880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2717 (or 2707 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 43.
The square root of 66258880 is about 8139.9557738356. The cubic root of 66258880 is about 404.6516946453.
The spelling of 66258880 in words is "sixty-six million, two hundred fifty-eight thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •