Base | Representation |
---|---|
bin | 1111110001110… |
… | …0000010100101 |
3 | 11121112001020011 |
4 | 3330130002211 |
5 | 113420101031 |
6 | 10322210221 |
7 | 1432323304 |
oct | 374340245 |
9 | 147461204 |
10 | 66175141 |
11 | 343993aa |
12 | 1a1b3971 |
13 | 1092c8b6 |
14 | 8b0843b |
15 | 5c226b1 |
hex | 3f1c0a5 |
66175141 has 4 divisors (see below), whose sum is σ = 66243852. Its totient is φ = 66106432.
The previous prime is 66175127. The next prime is 66175159. The reversal of 66175141 is 14157166.
66175141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 53714241 + 12460900 = 7329^2 + 3530^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66175141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66175121) 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, 32890 + ... + 34843.
It is an arithmetic number, because the mean of its divisors is an integer number (16560963).
Almost surely, 266175141 is an apocalyptic number.
It is an amenable number.
66175141 is a deficient number, since it is larger than the sum of its proper divisors (68711).
66175141 is an equidigital number, since it uses as much as digits as its factorization.
66175141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68710.
The product of its digits is 5040, while the sum is 31.
The square root of 66175141 is about 8134.8104464702. The cubic root of 66175141 is about 404.4811544191.
The spelling of 66175141 in words is "sixty-six million, one hundred seventy-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •