Base | Representation |
---|---|
bin | 1111110000010… |
… | …1110100001100 |
3 | 11121100102100120 |
4 | 3330011310030 |
5 | 113404142413 |
6 | 10320224540 |
7 | 1431464016 |
oct | 374056414 |
9 | 147312316 |
10 | 66084108 |
11 | 34336a72 |
12 | 1a16b150 |
13 | 108ca32c |
14 | 8ac31b6 |
15 | 5c05723 |
hex | 3f05d0c |
66084108 has 12 divisors (see below), whose sum is σ = 154196280. Its totient is φ = 22028032.
The previous prime is 66084107. The next prime is 66084113. The reversal of 66084108 is 80148066.
66084108 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (66084101) 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 3 ways as a sum of consecutive naturals, for example, 2753493 + ... + 2753516.
It is an arithmetic number, because the mean of its divisors is an integer number (12849690).
Almost surely, 266084108 is an apocalyptic number.
It is an amenable number.
66084108 is an abundant number, since it is smaller than the sum of its proper divisors (88112172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66084108 is a wasteful number, since it uses less digits than its factorization.
66084108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5507016 (or 5507014 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 33.
The square root of 66084108 is about 8129.2132460651. The cubic root of 66084108 is about 404.2955961694.
The spelling of 66084108 in words is "sixty-six million, eighty-four thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •