8136
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
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22230
- Proper Divisor Sum (Aliquot Sum)
- 14094
- 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
- 2688
- Möbius Function
- 0
- Radical
- 678
- Omega Function (Ω)
- 6
- 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
- 158
- 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 compositions of n into 4 ordered relatively prime parts.at n=36A000742
- Theta series of lattice Kappa_10.at n=5A015232
- a(n) = 2*a(n-1) + 7*a(n-2), with a(0) = 0, a(1) = 1.at n=8A015519
- a(n) is least k such that k and 7k are anagrams in base n (written in base 10).at n=9A023099
- Graham-Sloane-type lower bound on the size of a ternary (n,3,7) constant-weight code.at n=6A030507
- Least term in period of continued fraction for sqrt(n) is 5.at n=29A031429
- a(n) = Sum_{i=0..n} T(i,n-i) where T is A049627.at n=42A049628
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049723.at n=19A049724
- Open 3-dimensional ball numbers (version 2): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,0,0).at n=25A053594
- Triangle of number of rises in restricted growth strings (RGS) for the set partitions of n.at n=40A056858
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2*x+3*x^2)^n.at n=43A084608
- Row sums of triangle A132733.at n=11A132734
- a(1)=1, a(n)=a(n-1)+n^3 if n odd, a(n)=a(n-1)+ n^0 if n is even.at n=15A140152
- Diagonal sums of number triangle A154221.at n=15A154223
- a(n) = 25*n^2 + 2*n.at n=17A154377
- Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^5 = I.at n=8A163315
- Number of 3 X 3 magilatin squares with positive values and magic sum n.at n=15A173549
- a(n) = n*(14*n + 3).at n=24A195025
- Number of (n+1)X(n+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly two equal edges, and new values 0..2 introduced in row major order.at n=3A206207
- Number of (n+1)X5 0..2 arrays with every 2X3 or 3X2 subblock having exactly two equal edges, and new values 0..2 introduced in row major order.at n=3A206211