Base | Representation |
---|---|
bin | 1111110000000… |
… | …1001100110000 |
3 | 11121022110102021 |
4 | 3330001030300 |
5 | 113403041300 |
6 | 10320001224 |
7 | 1431354625 |
oct | 374011460 |
9 | 147273367 |
10 | 66065200 |
11 | 34323843 |
12 | 1a160214 |
13 | 108c1846 |
14 | 8aba34c |
15 | 5beed1a |
hex | 3f01330 |
66065200 has 120 divisors (see below), whose sum is σ = 170489088. Its totient is φ = 24541440.
The previous prime is 66065183. The next prime is 66065201. The reversal of 66065200 is 256066.
It is a super-2 number, since 2×660652002 = 8729221302080000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66065201) 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 23 ways as a sum of consecutive naturals, for example, 395517 + ... + 395683.
Almost surely, 266065200 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 66065200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85244544).
66065200 is an abundant number, since it is smaller than the sum of its proper divisors (104423888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66065200 is a wasteful number, since it uses less digits than its factorization.
66065200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251 (or 240 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 66065200 is about 8128.0501966954. The cubic root of 66065200 is about 404.2570334420.
The spelling of 66065200 in words is "sixty-six million, sixty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •