7074
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 8766
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2340
- Möbius Function
- 0
- Radical
- 786
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 31
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 8 positive 7th powers.at n=28A003375
- Numbers that are the sum of 4 nonzero 8th powers.at n=7A003382
- Numbers that are the sum of at most 4 nonzero 8th powers.at n=23A004877
- Numbers that are the sum of at most 5 nonzero 8th powers.at n=31A004878
- Shifts left when inverse Moebius transform applied twice.at n=41A007557
- a(n) = least m such that if r and s in {F(2*h-1)/F(2*h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers).at n=5A024829
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 84.at n=1A031582
- a(n) = floor ( n(n+1)(n+2)(n+3) / (n+(n+1)+(n+2)+(n+3)) ).at n=29A032767
- Number of ternary codes of length 3 with n words.at n=17A034215
- Number of ternary codes of length 3 with n words.at n=10A034215
- Number of ternary codes (not necessarily linear) of length n with 10 words.at n=2A034230
- Numbers n such that 107*2^n-1 is prime.at n=17A050579
- Sum of a(n) terms of 1/k^(4/5) first exceeds n.at n=25A056180
- Engel expansion of Gamma(2/3) = 1.35412.at n=8A059189
- Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.at n=24A065511
- Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity.at n=36A069259
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=17A083752
- Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges and k leaves.at n=52A091320
- a(n) = 2*a(n-1) - a(n-2) + n + 1.at n=33A121968
- Twice 12-gonal numbers: a(n) = 2*n*(5*n-4).at n=27A152965