Base | Representation |
---|---|
bin | 111101110000100000… |
… | …110111111001100001 |
3 | 20100011102001112021221 |
4 | 331300200313321201 |
5 | 2041301404101301 |
6 | 50244032015041 |
7 | 4535164121566 |
oct | 756040677141 |
9 | 210142045257 |
10 | 66312175201 |
11 | 26139548788 |
12 | 10a27991481 |
13 | 633a3c76bc |
14 | 32d0d2486d |
15 | 1ad19a1da1 |
hex | f70837e61 |
66312175201 has 8 divisors (see below), whose sum is σ = 67630363560. Its totient is φ = 64996468992.
The previous prime is 66312175157. The next prime is 66312175271. The reversal of 66312175201 is 10257121366.
It can be written as a sum of positive squares in 4 ways, for example, as 1989070801 + 64323104400 = 44599^2 + 253620^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 66312175201 - 27 = 66312175073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66312175271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 566530 + ... + 673483.
It is an arithmetic number, because the mean of its divisors is an integer number (8453795445).
Almost surely, 266312175201 is an apocalyptic number.
It is an amenable number.
66312175201 is a deficient number, since it is larger than the sum of its proper divisors (1318188359).
66312175201 is a wasteful number, since it uses less digits than its factorization.
66312175201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1241075.
The product of its (nonzero) digits is 15120, while the sum is 34.
Adding to 66312175201 its reverse (10257121366), we get a palindrome (76569296567).
The spelling of 66312175201 in words is "sixty-six billion, three hundred twelve million, one hundred seventy-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •