12117361

Appears in sequences

• Sum of 4th powers of primes = 2 mod 3 dividing n.at n=58A005077
• Sum of 4th powers of primes = 3 mod 4 dividing n.at n=58A005085
• a(n) = (2*n+1)^4.at n=29A016756
• a(n) = (3*n+2)^4.at n=19A016792
• a(n) = (4*n+3)^4.at n=14A016840
• a(n) = (5*n + 4)^4.at n=11A016900
• a(n) = (6*n + 5)^4.at n=9A016972
• a(n) = (7*n + 3)^4.at n=8A017020
• a(n) = (8*n+3)^4.at n=7A017104
• a(n) = (9*n + 5)^4.at n=6A017224
• a(n) = (10*n + 9)^4.at n=5A017380
• a(n) = (11*n + 4)^4.at n=5A017440
• a(n) = (12*n + 11)^4.at n=4A017656
• a(n) = prime(n)^4.at n=16A030514
• Prime powers n such that both tau(n^2) and sigma(n^2) are composite numbers.at n=31A065771
• Fourth powers m^4 none of whose digits are present in their corresponding roots m.at n=15A113316
• Exclusionary biquadrates (fourth powers).at n=14A113317
• a(n) = A006720(n)^4 (fourth powers of Somos-4 sequence).at n=8A151502
• a(n) = the smallest n-digit number with exactly 5 divisors, or 0 if no such number exists.at n=7A174336
• Numbers of the form p^q^r, for p,q,r primes.at n=23A217709