7964
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15288
- Proper Divisor Sum (Aliquot Sum)
- 7324
- 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
- 3600
- Möbius Function
- 0
- Radical
- 3982
- Omega Function (Ω)
- 4
- 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
- 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
- Number of protruded partitions of n with largest part at most 4.at n=14A005405
- a(n) = T(2n-1,n), where T is the array in A026098.at n=41A026102
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 3 and 4 (mod 5).at n=51A035587
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.at n=45A064933
- Starting positions of strings of three 2's in the decimal expansion of Pi.at n=8A083606
- Starting positions of strings of four 2's in the decimal expansion of Pi.at n=1A083607
- Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n-2). r and s are positive integers.at n=39A085950
- Numbers k such that k divides the (k+1)st Lucas number.at n=5A094397
- Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=10A097647
- (Sum of the squares of the quadratic residues of prime(n)) / prime(n).at n=45A125614
- 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, 0), (0, -1, 0), (0, 1, -1), (0, 1, 1), (1, 0, -1)}.at n=8A149332
- 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, 0, 0), (0, 1, 0), (1, -1, -1), (1, 1, 1)}.at n=7A150515
- a(n+1) = A154771(a(n)) = sum of all distinct "valid substrings" of a(n); a(1)=10 (least nontrivial choice).at n=34A154770
- a(n) = 2662*n - 22.at n=2A157609
- Number of line segments connecting exactly 8 points in an n x n grid of points.at n=32A177724
- Number of nondecreasing arrangements of 10 numbers in 0..n with the last equal to n and each after the second equal to the sum of one or two of the preceding four.at n=26A189333
- Number of lower triangles of a 3 X 3 0..n array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by two or less.at n=8A195249
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having four or six distinct values for every i,j,k<=n.at n=7A211573
- Numbers m with C(2*m, m) - prime(m) prime, where C(2*m, m) = (2*m)!/(m!)^2.at n=28A236248
- Number of ON cells at generation n of 2-D cellular automaton in which a cell is ON iff either 1, 2 or 4 of its eight neighbors were ON at previous generation, starting with a single ON cell.at n=65A246309