Base | Representation |
---|---|
bin | 1111110001110… |
… | …0010001000000 |
3 | 11121112002111100 |
4 | 3330130101000 |
5 | 113420113224 |
6 | 10322214400 |
7 | 1432326063 |
oct | 374342100 |
9 | 147462440 |
10 | 66176064 |
11 | 3439a069 |
12 | 1a1b4400 |
13 | 10930146 |
14 | 8b088da |
15 | 5c22ac9 |
hex | 3f1c440 |
66176064 has 42 divisors (see below), whose sum is σ = 189683390. Its totient is φ = 22058496.
The previous prime is 66176063. The next prime is 66176081. The reversal of 66176064 is 46067166.
It can be written as a sum of positive squares in only one way, i.e., 57881664 + 8294400 = 7608^2 + 2880^2 .
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (66176063) 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 5 ways as a sum of consecutive naturals, for example, 56869 + ... + 58020.
Almost surely, 266176064 is an apocalyptic number.
66176064 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
66176064 is an abundant number, since it is smaller than the sum of its proper divisors (123507326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66176064 is a wasteful number, since it uses less digits than its factorization.
66176064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114907 (or 114894 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The square root of 66176064 is about 8134.8671777725. The cubic root of 66176064 is about 404.4830349559.
The spelling of 66176064 in words is "sixty-six million, one hundred seventy-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •