7976
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14970
- Proper Divisor Sum (Aliquot Sum)
- 6994
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- 0
- Radical
- 1994
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 52
- 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
- Numerators of worst case for Engel expansion.at n=33A006539
- Expansion of f(f(x)), where f = x + x^2 + x^4 + x^8 + x^16 + ...at n=20A007801
- a(n) = (d(n)-r(n))/2, where d = A026054 and r is the periodic sequence with fundamental period (1,0,0,0).at n=40A026055
- 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 43.at n=33A031541
- Numbers k such that us(k) = primepi(k), where us(k) is the sum of the aliquot unitary divisors of k (A034460), and primepi(k) is the number of primes <= k (A000720).at n=10A037176
- Number of partitions of n with equal number of parts congruent to each of 0, 1, 2 and 3 (mod 4).at n=68A046770
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1, 2 and 3 (mod 4).at n=68A046782
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u2.at n=24A048190
- a(n) = floor(4076/(10-n)^2/0.51099906).at n=8A109553
- Triangle, read by rows, equal to the matrix square of A113983.at n=39A113988
- Column 3 of triangle A113988, which is the matrix square of A113983: a(n) = [A113983^2](n+3,3).at n=5A113992
- Number of partitions of n such that the least part occurs at least twice.at n=32A117989
- Least k such that k*p(n)!/p(n)# -1 and k*p(n)!/p(n)# +1 are twin primes starting with n=3,(p(i)=i-th prime).at n=33A124086
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=9A148689
- a(n) = Sum_{k=0..n} binomial(n,2k)*A002426(k).at n=11A162533
- a(n) = 8*(10^n - 3).at n=2A175602
- E.g.f. satisfies: A(x) = Sum_{n>=0} x^n*A(n*x)^n/n!.at n=5A192036
- Monotonic ordering of nonnegative differences 2^i-6^j, for 40>=i>=0, j>=0.at n=39A192116
- a(n) = n*Fibonacci(n) * Sum_{d|n} 1/(d*Fibonacci(d)).at n=13A203319
- Numbers k such that 6k+1, 12k+1, 18k+1 and 36k+1 are all primes.at n=34A206024