Base | Representation |
---|---|
bin | 1111111010110… |
… | …0000101001101 |
3 | 11122122000112201 |
4 | 3332230011031 |
5 | 114042441013 |
6 | 10343001501 |
7 | 1440331351 |
oct | 376540515 |
9 | 148560481 |
10 | 66765133 |
11 | 347616a6 |
12 | 1a439291 |
13 | 10aa82c6 |
14 | 8c1d461 |
15 | 5cdc3dd |
hex | 3fac14d |
66765133 has 4 divisors (see below), whose sum is σ = 66842140. Its totient is φ = 66688128.
The previous prime is 66765121. The next prime is 66765157. The reversal of 66765133 is 33156766.
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 58936329 + 7828804 = 7677^2 + 2798^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66765133 is a prime.
It is a super-3 number, since 3×667651333 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66765092 and 66765101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66765533) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37188 + ... + 38941.
It is an arithmetic number, because the mean of its divisors is an integer number (16710535).
Almost surely, 266765133 is an apocalyptic number.
It is an amenable number.
66765133 is a deficient number, since it is larger than the sum of its proper divisors (77007).
66765133 is an equidigital number, since it uses as much as digits as its factorization.
66765133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77006.
The product of its digits is 68040, while the sum is 37.
The square root of 66765133 is about 8170.9933912591. The cubic root of 66765133 is about 405.6796655440.
The spelling of 66765133 in words is "sixty-six million, seven hundred sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.279 sec. • engine limits •