Base | Representation |
---|---|
bin | 1111111010101… |
… | …1101110000000 |
3 | 11122121221111201 |
4 | 3332223232000 |
5 | 114042414043 |
6 | 10342550544 |
7 | 1440324130 |
oct | 376535600 |
9 | 148557451 |
10 | 66763648 |
11 | 34760576 |
12 | 1a438454 |
13 | 10aa7723 |
14 | 8c1cac0 |
15 | 5cdbc4d |
hex | 3fabb80 |
66763648 has 64 divisors (see below), whose sum is σ = 153122400. Its totient is φ = 28403712.
The previous prime is 66763639. The next prime is 66763657. The reversal of 66763648 is 84636766.
It is an interprime number because it is at equal distance from previous prime (66763639) and next prime (66763657).
It is a tau number, because it is divible by the number of its divisors (64).
Its product of digits (870912) is a multiple of the sum of its prime factors (567).
It is a junction number, because it is equal to n+sod(n) for n = 66763598 and 66763607.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240886 + ... + 241162.
Almost surely, 266763648 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 66763648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76561200).
66763648 is an abundant number, since it is smaller than the sum of its proper divisors (86358752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66763648 is a wasteful number, since it uses less digits than its factorization.
66763648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567 (or 555 counting only the distinct ones).
The product of its digits is 870912, while the sum is 46.
The square root of 66763648 is about 8170.9025205298. The cubic root of 66763648 is about 405.6766577926.
The spelling of 66763648 in words is "sixty-six million, seven hundred sixty-three thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •