7164
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 18200
- Proper Divisor Sum (Aliquot Sum)
- 11036
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2376
- Möbius Function
- 0
- Radical
- 1194
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 101
- 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
- Expansion of (theta_3(z)*theta_3(7z)+theta_2(z)*theta_2(7z))^3.at n=37A002653
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=35A003452
- a(n) = floor(Fibonacci(n)/4).at n=23A004697
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=36A004946
- Number of strict 5th-order maximal independent sets in path graph.at n=50A007385
- Theta series of 6-dimensional 8-modular lattice of minimal norm 4.at n=38A029713
- Numerators of continued fraction convergents to sqrt(996).at n=9A042928
- a(n) = (F(3*n+2) - 1)/4, where F=A000045 (the Fibonacci sequence).at n=7A049652
- a(n) = (F(6*n+5) - 1)/4, where F = A000045 (the Fibonacci sequence).at n=3A049663
- Row sums of A053207.at n=11A053208
- Number of permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={1,3}.at n=20A079962
- Numbers k such that 2^(2*k+1) + 2^k + 1 is prime.at n=31A105180
- Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k (1,0)-steps at level zero. (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).).at n=67A109189
- Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the line y=x (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)).at n=30A109979
- n(k) is the minimum n that requires at least k to make 2*Prime[n]+Prime[n-k] a prime.at n=47A114237
- Total area of all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=5A121553
- Inverse binomial matrix applied to A110877.at n=48A126093
- a(n) = a(n-1) + a(n-2) + 1 if n is a multiple of 6, otherwise a(n) = a(n-1) + a(n-2).at n=19A131132
- Row sums of the Riordan array (1/(1+x),x(1+2x)/(1+x)^3)^(-1).at n=10A138175
- Second differences of perfect numbers A000396.at n=1A139230