Base | Representation |
---|---|
bin | 1111111001011… |
… | …0001000000101 |
3 | 11122110110012001 |
4 | 3332112020011 |
5 | 114032101310 |
6 | 10341025301 |
7 | 1436505232 |
oct | 376261005 |
9 | 148413161 |
10 | 66675205 |
11 | 34700083 |
12 | 1a3b5231 |
13 | 10a763ac |
14 | 8bd8789 |
15 | 5cc093a |
hex | 3f96205 |
66675205 has 8 divisors (see below), whose sum is σ = 82769400. Its totient is φ = 51500736.
The previous prime is 66675197. The next prime is 66675209. The reversal of 66675205 is 50257666.
66675205 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 187489 + 66487716 = 433^2 + 8154^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 66675205 - 23 = 66675197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66675209) 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 7 ways as a sum of consecutive naturals, for example, 229770 + ... + 230059.
It is an arithmetic number, because the mean of its divisors is an integer number (10346175).
Almost surely, 266675205 is an apocalyptic number.
It is an amenable number.
66675205 is a deficient number, since it is larger than the sum of its proper divisors (16094195).
66675205 is a wasteful number, since it uses less digits than its factorization.
66675205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459863.
The product of its (nonzero) digits is 75600, while the sum is 37.
The square root of 66675205 is about 8165.4886565349. The cubic root of 66675205 is about 405.4974429219.
The spelling of 66675205 in words is "sixty-six million, six hundred seventy-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •