7834
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11754
- Proper Divisor Sum (Aliquot Sum)
- 3920
- 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
- 3916
- Möbius Function
- 1
- Radical
- 7834
- Omega Function (Ω)
- 2
- 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
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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 k such that the continued fraction for sqrt(k) has period 77.at n=5A020416
- Number of 3's in n-th term of A006711.at n=37A022479
- Number of partitions of n that do not contain 3 as a part.at n=36A027337
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 36 ones.at n=40A031804
- McKay-Thompson series of class 42D for Monster.at n=47A058674
- a(n) = (9*n^2 + 13*n + 6)/2.at n=41A064226
- Fourth row of Pascal-(1,2,1) array A081577.at n=7A081584
- Triangular sequence of coefficients from a polynomial recursion: p(x,n)=-2 (-(n - 1) + x)*p(x, n - 1) + (-(n + 1) + (n + 2)* x - x^2)p(x, n - 2).at n=31A137663
- a(n) = (9*n^2 - 5*n + 2)/2.at n=42A140064
- Sums of prime points found in four grids in each corner of a square.at n=30A161190
- Numbers k such that k, k^2 - 5, and k^2 + 5 are semiprime.at n=36A173085
- Expansion of (1/(1-x+x^2))c(x/(1-x+x^2)), c(x) the g.f. of A000108.at n=8A174107
- Number of iterations of the map n -> sum of the n-powers of the decimal digits of n.at n=45A182160
- Number of partitions of n such that the number of parts and the largest part and the smallest part are pairwise not coprime.at n=50A200476
- (A209982)/2.at n=40A209983
- Number of (5+1)X(n+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=9A253702
- Number of length n+5 0..3 arrays with at most one downstep in every 5 consecutive neighbor pairs.at n=2A258727
- T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs.at n=23A258730
- Number of length n+3 0..3 arrays with at most one downstep in every n consecutive neighbor pairs.at n=4A258733
- a(n) = number of inequivalent necklaces with beads labeled 1/i (1 <= i <= n) such that the sum of the beads is 1 and the smallest bead is 1/n.at n=11A259633