Base | Representation |
---|---|
bin | 1111111010110… |
… | …0010101000000 |
3 | 11122122001221011 |
4 | 3332230111000 |
5 | 114043004034 |
6 | 10343010304 |
7 | 1440334324 |
oct | 376542500 |
9 | 148561834 |
10 | 66766144 |
11 | 34762435 |
12 | 1a439994 |
13 | 10aa88c3 |
14 | 8c1d984 |
15 | 5cdc864 |
hex | 3fac540 |
66766144 has 14 divisors (see below), whose sum is σ = 132489194. Its totient is φ = 33383040.
The previous prime is 66766129. The next prime is 66766159. The reversal of 66766144 is 44166766.
It is a happy number.
66766144 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (66766129) and next prime (66766159).
It can be written as a sum of positive squares in only one way, i.e., 65934400 + 831744 = 8120^2 + 912^2 .
It is a junction number, because it is equal to n+sod(n) for n = 66766097 and 66766106.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 521547 + ... + 521674.
Almost surely, 266766144 is an apocalyptic number.
66766144 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
66766144 is a deficient number, since it is larger than the sum of its proper divisors (65723050).
66766144 is a wasteful number, since it uses less digits than its factorization.
66766144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043233 (or 1043223 counting only the distinct ones).
The product of its digits is 145152, while the sum is 40.
The square root of 66766144 is about 8171.0552562077. The cubic root of 66766144 is about 405.6817132199.
The spelling of 66766144 in words is "sixty-six million, seven hundred sixty-six thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •