7196
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14448
- Proper Divisor Sum (Aliquot Sum)
- 7252
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3072
- Möbius Function
- 0
- Radical
- 3598
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 70
- 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 n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,1,1).at n=5A003287
- Expansion of e.g.f. (1+x)^(exp(x)).at n=8A007116
- Denominators of continued fraction convergents to sqrt(337).at n=9A041637
- a(n) = Sum_{k=0..n} Stirling2(n,k)*(1+(-1)^k)*2^k/2.at n=7A065143
- Seventh convolution of Schroeder's (second problem) numbers A001003(n), n >= 0.at n=5A111995
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 1)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=42A146765
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 1)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=38A146765
- 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, 1), (-1, 0, 0), (0, 1, 1), (1, -1, -1), (1, 1, 0)}.at n=7A150426
- Triangle T(n,k,p,q) = (p^n + q^n)*A001263(n, k) with p=2 and q=1, read by rows.at n=34A155537
- Triangle T(n,k,p,q) = (p^n + q^n)*A001263(n, k) with p=2 and q=1, read by rows.at n=29A155537
- a(n) = 8*a(n-1) - 14*a(n-2) for n > 1; a(0) = 1, a(1) = 7.at n=5A164072
- Partial sums of floor(n^3/2).at n=15A173704
- Number of (n+2)X(n+2) symmetric binary matrices without the pattern 1 1 1 diagonally, vertically or horizontally.at n=2A190421
- Triangle of sums of the first k n-th powers multiplied by binomial(n,k), read by rows.at n=38A215078
- Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.at n=35A224667
- Number n such that the sum of its proper evil divisors (A001969) equals n.at n=9A230587
- Number of (n+1) X (n+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=7A235281
- Number of (n+1) X (7+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=8A235288
- Number of 4 X n 0..2 arrays with no element equal to the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=16A239031
- Number of rectangles formed by the absolute leader classes of the seven dimensional integer lattice as function of the infinity norm n, where the rectangles have one common lattice point being the origin of the seven dimensional integer lattice.at n=1A240934