Base | Representation |
---|---|
bin | 11110000001010100110110… |
… | …11101110011001111011101 |
3 | 22122202002111100202010110201 |
4 | 33000222123131303033131 |
5 | 32123102242414320221 |
6 | 352223241003503501 |
7 | 16622342233100125 |
oct | 1700523335631735 |
9 | 278662440663421 |
10 | 66016255620061 |
11 | 1a0423782914aa |
12 | 74a2486527b91 |
13 | 2aab3c9923c86 |
14 | 12432bd3d7c85 |
15 | 79737abc5891 |
hex | 3c0a9b7733dd |
66016255620061 has 4 divisors (see below), whose sum is σ = 66016449905152. Its totient is φ = 66016061334972.
The previous prime is 66016255620053. The next prime is 66016255620067. The reversal of 66016255620061 is 16002655261066.
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 not a de Polignac number, because 66016255620061 - 23 = 66016255620053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66016255619993 and 66016255620020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66016255620067) 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, 96631965 + ... + 97312738.
It is an arithmetic number, because the mean of its divisors is an integer number (16504112476288).
Almost surely, 266016255620061 is an apocalyptic number.
It is an amenable number.
66016255620061 is a deficient number, since it is larger than the sum of its proper divisors (194285091).
66016255620061 is a wasteful number, since it uses less digits than its factorization.
66016255620061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194285090.
The product of its (nonzero) digits is 777600, while the sum is 46.
The spelling of 66016255620061 in words is "sixty-six trillion, sixteen billion, two hundred fifty-five million, six hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •