7634
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12528
- Proper Divisor Sum (Aliquot Sum)
- 4894
- 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
- 3460
- Möbius Function
- -1
- Radical
- 7634
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 83
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of nonisomorphic disconnected partial lattices.at n=9A030269
- 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 86.at n=14A031584
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.at n=22A061154
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k.at n=32A109158
- Triangle read by rows: T(n,k) (n,k>=0) = number of peakless Motzkin paths of length n having k valleys (i.e., (1,-1) followed by (1,1)) at level zero (can be easily translated into RNA secondary structure terminology).at n=34A110333
- 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, 0, 1), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=7A150498
- Expansion of x*(1+2*x+8*x^2+4*x^3+3*x^4) / ( (1+x)^2*(x-1)^4 ).at n=21A178947
- a(n) = n*prime(prime(n)) - prime(n).at n=20A230285
- Number of partitions of n where the difference between consecutive parts is at most 5.at n=34A238865
- a(n) = Lucas(n) concatenated with Fibonacci(n).at n=9A247337
- Indices of the start of 9 successive distinct digits in the decimal expansion of Pi.at n=21A258158
- G.f.: Sum_{n=-oo..+oo, n<>0} x^(n^2) / (1 - x^n)^(n+1).at n=71A261608
- Numbers n such that Bernoulli number B_{n} has denominator 138.at n=44A271635
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 705", based on the 5-celled von Neumann neighborhood.at n=17A273419
- Expansion of Product_{k>=1} 1/(1 - x^prime(k))^A056768(k).at n=35A321508
- Partial sums of A071619.at n=32A358042
- Number of integer partitions of n - 1 containing fewer 1's than any other part.at n=42A364159
- Array read by downward antidiagonals: A(n,k) = Sum_{i=0..n-1} Sum_{j=0..k+1} binomial(n-1,i)*binomial(k+1,j)*A(i,j) with A(0,k) = 1, n >= 0, k >= 0.at n=31A383410