Base | Representation |
---|---|
bin | 1111110111111… |
… | …0000001000000 |
3 | 11122021102201101 |
4 | 3331332001000 |
5 | 114020421243 |
6 | 10334544144 |
7 | 1435614301 |
oct | 375760100 |
9 | 148242641 |
10 | 66576448 |
11 | 34642964 |
12 | 1a368054 |
13 | 10a40463 |
14 | 8bb07a8 |
15 | 5ca154d |
hex | 3f7e040 |
66576448 has 28 divisors (see below), whose sum is σ = 133169152. Its totient is φ = 33022080.
The previous prime is 66576409. The next prime is 66576457. The reversal of 66576448 is 84467566.
66576448 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
66576448 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 66576398 and 66576407.
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, 4033 + ... + 12223.
Almost surely, 266576448 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 66576448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66584576).
66576448 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66576448 is a wasteful number, since it uses less digits than its factorization.
66576448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8330 (or 8320 counting only the distinct ones).
The product of its digits is 967680, while the sum is 46.
The square root of 66576448 is about 8159.4391964154. The cubic root of 66576448 is about 405.2971410821.
The spelling of 66576448 in words is "sixty-six million, five hundred seventy-six thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •