# Tag Info

### Find the sum of the divisors of N

05AB1E, 2 bytes ÑO Try it online! How? Ñ Divisors O Sum
• 11.6k

### Am I not good enough for you?

Brachylog, 4 bytes fk+? Try it online! The predicate succeeds for perfect inputs and fails for imperfect inputs, printing ...
• 21.3k

### Prime factors buddies

PowerShell v3+, 450 bytes ...
• 43.4k

### Calculate the prime factors

Python 2, 55 bytes f=lambda n,k=2:n/k*[0]and(f(n,k+1),[k]+f(n/k,k))[n%k<1] Try it online!
• 210k

### Calculate the prime factors

Pyth, 1 byte P I like Pyth's chances in this challenge.
• 42k
Accepted

### Encode an integer

Husk, 35 31 30 29 26 25 24 22 20 19 15 bytes -7 bytes thanks to @Zgarb! Saved an extra 4 bytes, indirectly, thanks to Zgarb ḋhΣhgφṁȯ`Jḋ2⁰ṗp Try it online! ...
• 11.6k

• 197k

### Calculate the prime factors

Mathematica, 38 30 bytes Thanks @MartinEnder for 8 bytes! Join@@Table@@@FactorInteger@#&
• 13.8k

### Encode an integer

Jelly,  22 20  19 bytes -1 thanks to Erik the Outgolfer (tail zeros from both sides, t, rather than from the right œr)...
• 106k

### Largest Prime Exponents

05AB1E, 2 bytes ÓZ Try it online! How? Ó exponents of prime factors Z maximum
• 13.2k

### Largest Prime Exponents

Python 2, 62 57 56 bytes lambda n:max(k%n-n%(k/n+2)**(k%n)*n for k in range(n*n)) Try it online!
• 210k

### Prime Factor Encoding

05AB1E, 13 bytes Encoder, 8 bytes 0ì¥ĀηOØP Try it online! Explanation ...
• 53k

### Find the Squarish Root

MATL, 7 bytes Z\tn2/) Try it online! For this explanation, we will use '12' as a sample input. Explanation: ...
• 59.2k

### Am I not good enough for you?

Japt -!, 4 bytes ...

### Looks prime to me!

JavaScript (ES6),  91 83 79  76 bytes f=(b,n=b,k=n)=>(g=d=>k<2?d<n:k%d?g(d+1):b*~-b*~b%d&&g(d,k/=d))(2)?n:f(b,n+1) Try it online! How? Given ...
• 192k

### Find the sum of the divisors of N

x86-64 Machine Code, 23 bytes 89 F9 89 FE EB 0D 89 F8 99 F7 F1 85 D2 99 0F 44 D1 01 D6 E2 F1 96 C3 The above bytes of code define a function that accepts a single ...

Only top scored, non community-wiki answers of a minimum length are eligible