Base | Representation |
---|---|
bin | 1111110010001… |
… | …1100000101100 |
3 | 11121120121012110 |
4 | 3330203200230 |
5 | 113422040430 |
6 | 10323004020 |
7 | 1432511436 |
oct | 374434054 |
9 | 147517173 |
10 | 66205740 |
11 | 3440a397 |
12 | 1a209610 |
13 | 109407c3 |
14 | 8b15656 |
15 | 5c2b7b0 |
hex | 3f2382c |
66205740 has 48 divisors (see below), whose sum is σ = 188425440. Its totient is φ = 17364480.
The previous prime is 66205723. The next prime is 66205781. The reversal of 66205740 is 4750266.
66205740 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 66205698 and 66205707.
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 15 ways as a sum of consecutive naturals, for example, 5385 + ... + 12704.
It is an arithmetic number, because the mean of its divisors is an integer number (3925530).
Almost surely, 266205740 is an apocalyptic number.
66205740 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
66205740 is an abundant number, since it is smaller than the sum of its proper divisors (122219700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66205740 is a wasteful number, since it uses less digits than its factorization.
66205740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18162 (or 18160 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 66205740 is about 8136.6909736084. The cubic root of 66205740 is about 404.5434880563.
The spelling of 66205740 in words is "sixty-six million, two hundred five thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •