Base | Representation |
---|---|
bin | 1111110001010… |
… | …0100110001100 |
3 | 11121110111101221 |
4 | 3330110212030 |
5 | 113413112102 |
6 | 10321413124 |
7 | 1432135360 |
oct | 374244614 |
9 | 147414357 |
10 | 66144652 |
11 | 34378502 |
12 | 1a19a1a4 |
13 | 1091ba62 |
14 | 8adb2a0 |
15 | 5c18637 |
hex | 3f1498c |
66144652 has 12 divisors (see below), whose sum is σ = 132289360. Its totient is φ = 28347696.
The previous prime is 66144623. The next prime is 66144653. The reversal of 66144652 is 25644166.
66144652 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
66144652 is an admirable number.
It is a super-2 number, since 2×661446522 = 8750229976402208, which contains 22 as substring.
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (66144653) 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, 1181127 + ... + 1181182.
Almost surely, 266144652 is an apocalyptic number.
It is an amenable number.
66144652 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66144652 is a wasteful number, since it uses less digits than its factorization.
66144652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2362320 (or 2362318 counting only the distinct ones).
The product of its digits is 34560, while the sum is 34.
The square root of 66144652 is about 8132.9362471373. The cubic root of 66144652 is about 404.4190257498.
The spelling of 66144652 in words is "sixty-six million, one hundred forty-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •