Base | Representation |
---|---|
bin | 11110000100000100101100… |
… | …01011101001101001110101 |
3 | 22200002010011022012100002121 |
4 | 33002002112023221221311 |
5 | 32131124111000203004 |
6 | 352334452145035541 |
7 | 16632223456212655 |
oct | 1702022613515165 |
9 | 280063138170077 |
10 | 66110656256629 |
11 | 1a07940aa56a16 |
12 | 74b8831025bb1 |
13 | 2ab729236cbca |
14 | 1247ab6938365 |
15 | 799a53564854 |
hex | 3c20962e9a75 |
66110656256629 has 4 divisors (see below), whose sum is σ = 67016281684876. Its totient is φ = 65205030828384.
The previous prime is 66110656256569. The next prime is 66110656256647. The reversal of 66110656256629 is 92665265601166.
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 51762484998225 + 14348171258404 = 7194615^2 + 3787898^2 .
It is a cyclic number.
It is not a de Polignac number, because 66110656256629 - 225 = 66110622702197 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 (66110656256669) 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, 452812714014 + ... + 452812714159.
It is an arithmetic number, because the mean of its divisors is an integer number (16754070421219).
Almost surely, 266110656256629 is an apocalyptic number.
It is an amenable number.
66110656256629 is a deficient number, since it is larger than the sum of its proper divisors (905625428247).
66110656256629 is an equidigital number, since it uses as much as digits as its factorization.
66110656256629 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 905625428246.
The product of its (nonzero) digits is 41990400, while the sum is 61.
The spelling of 66110656256629 in words is "sixty-six trillion, one hundred ten billion, six hundred fifty-six million, two hundred fifty-six thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •