Base | Representation |
---|---|
bin | 1111111000001… |
… | …0001110000000 |
3 | 11122022022100000 |
4 | 3332002032000 |
5 | 114021444124 |
6 | 10335200000 |
7 | 1436015424 |
oct | 376021600 |
9 | 148268300 |
10 | 66593664 |
11 | 34654895 |
12 | 1a376000 |
13 | 10a48247 |
14 | 8bb6b84 |
15 | 5ca66c9 |
hex | 3f82380 |
66593664 has 96 divisors (see below), whose sum is σ = 198820440. Its totient is φ = 22187520.
The previous prime is 66593663. The next prime is 66593677. The reversal of 66593664 is 46639566.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66593663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30034 + ... + 32174.
Almost surely, 266593664 is an apocalyptic number.
66593664 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66593664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99410220).
66593664 is an abundant number, since it is smaller than the sum of its proper divisors (132226776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66593664 is an equidigital number, since it uses as much as digits as its factorization.
66593664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170 (or 2146 counting only the distinct ones).
The product of its digits is 699840, while the sum is 45.
The square root of 66593664 is about 8160.4941026877. The cubic root of 66593664 is about 405.3320733263.
The spelling of 66593664 in words is "sixty-six million, five hundred ninety-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •