Base | Representation |
---|---|
bin | 1111101111101… |
… | …1011011100000 |
3 | 11121021021000000 |
4 | 3323323123200 |
5 | 113401312233 |
6 | 10315300000 |
7 | 1431226005 |
oct | 373733340 |
9 | 147237000 |
10 | 66041568 |
11 | 3430800a |
12 | 1a14a600 |
13 | 108b3b68 |
14 | 8ab18ac |
15 | 5be7d13 |
hex | 3efb6e0 |
66041568 has 168 divisors, whose sum is σ = 206577000. Its totient is φ = 20715264.
The previous prime is 66041543. The next prime is 66041581. The reversal of 66041568 is 86514066.
It is a super-2 number, since 2×660415682 = 8722977407797248, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 443158 + ... + 443306.
It is an arithmetic number, because the mean of its divisors is an integer number (1229625).
Almost surely, 266041568 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 66041568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103288500).
66041568 is an abundant number, since it is smaller than the sum of its proper divisors (140535432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66041568 is a wasteful number, since it uses less digits than its factorization.
66041568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 173 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 66041568 is about 8126.5963354900. The cubic root of 66041568 is about 404.2088258049.
The spelling of 66041568 in words is "sixty-six million, forty-one thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •