Base | Representation |
---|---|
bin | 11110000101100001011011… |
… | …01110010111001110011101 |
3 | 22200020212200001102001001020 |
4 | 33002300231232113032131 |
5 | 32132433041444343221 |
6 | 352413404343234353 |
7 | 16635635314451235 |
oct | 1702605556271635 |
9 | 280225601361036 |
10 | 66160443356061 |
11 | 1a09853952568a |
12 | 75064067489b9 |
13 | 2abbb97c89762 |
14 | 124a27ac88cc5 |
15 | 79aeb93a2ac6 |
hex | 3c2c2db9739d |
66160443356061 has 8 divisors (see below), whose sum is σ = 88232899310400. Its totient is φ = 44097474819552.
The previous prime is 66160443356039. The next prime is 66160443356093. The reversal of 66160443356061 is 16065334406166.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 66160443356061 - 27 = 66160443355933 is a prime.
It is a super-2 number, since 2×661604433560612 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 66160443355995 and 66160443356013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66160443356461) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2371838185 + ... + 2371866078.
It is an arithmetic number, because the mean of its divisors is an integer number (11029112413800).
Almost surely, 266160443356061 is an apocalyptic number.
It is an amenable number.
66160443356061 is a deficient number, since it is larger than the sum of its proper divisors (22072455954339).
66160443356061 is a wasteful number, since it uses less digits than its factorization.
66160443356061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4743708915.
The product of its (nonzero) digits is 5598720, while the sum is 51.
The spelling of 66160443356061 in words is "sixty-six trillion, one hundred sixty billion, four hundred forty-three million, three hundred fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •