Base | Representation |
---|---|
bin | 1111110011110… |
… | …1111111011000 |
3 | 11121210002222111 |
4 | 3330331333120 |
5 | 113434023300 |
6 | 10325202104 |
7 | 1433442601 |
oct | 374757730 |
9 | 147702874 |
10 | 66314200 |
11 | 34483927 |
12 | 1a260334 |
13 | 1097ac94 |
14 | 8b42da8 |
15 | 5c4d9ba |
hex | 3f3dfd8 |
66314200 has 48 divisors (see below), whose sum is σ = 154911960. Its totient is φ = 26400000.
The previous prime is 66314189. The next prime is 66314201. The reversal of 66314200 is 241366.
It is a hoax number, since the sum of its digits (22) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66314201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49540 + ... + 50860.
Almost surely, 266314200 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 66314200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77455980).
66314200 is an abundant number, since it is smaller than the sum of its proper divisors (88597760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66314200 is a wasteful number, since it uses less digits than its factorization.
66314200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1588 (or 1579 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 66314200 is about 8143.3531177274. The cubic root of 66314200 is about 404.7642788239.
Adding to 66314200 its reverse (241366), we get a palindrome (66555566).
The spelling of 66314200 in words is "sixty-six million, three hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •