Base | Representation |
---|---|
bin | 11110000100001111101100… |
… | …11101101100010011010101 |
3 | 22200002200102012111011111102 |
4 | 33002013312131230103111 |
5 | 32131223212020103401 |
6 | 352341310435315445 |
7 | 16632523104054632 |
oct | 1702076635542325 |
9 | 280080365434442 |
10 | 66116566566101 |
11 | 1a0809731979a7 |
12 | 74b9a0044bb85 |
13 | 2ab79c499484c |
14 | 12480b787b189 |
15 | 799c9c38256b |
hex | 3c21f676c4d5 |
66116566566101 has 4 divisors (see below), whose sum is σ = 66130818902400. Its totient is φ = 66102314229804.
The previous prime is 66116566566049. The next prime is 66116566566131. The reversal of 66116566566101 is 10166566561166.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66116566566101 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 (66116566566131) 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, 7126161191 + ... + 7126170468.
It is an arithmetic number, because the mean of its divisors is an integer number (16532704725600).
Almost surely, 266116566566101 is an apocalyptic number.
It is an amenable number.
66116566566101 is a deficient number, since it is larger than the sum of its proper divisors (14252336299).
66116566566101 is a wasteful number, since it uses less digits than its factorization.
66116566566101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14252336298.
The product of its (nonzero) digits is 6998400, while the sum is 56.
The spelling of 66116566566101 in words is "sixty-six trillion, one hundred sixteen billion, five hundred sixty-six million, five hundred sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •