8694
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 14346
- 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
- 966
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 184
- 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
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=27A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=27A004967
- Number of symmetric sum-free subsets of {1,2,...,n-1} with sums taken mod n.at n=43A083041
- Numbers k such that numerator of Sum_{i=1..k} 1/(prime(i)-1) is prime.at n=57A092063
- a(n) = Sum_{k + l*m <= n} (k + l*m), with 0 <= k,l,m <= n.at n=16A106846
- Diagonal sums of a number triangle related to the Pell numbers.at n=5A110329
- Triangle read by rows where the n-th row is the first row of M^n, with M the (n+1)-by-(n+1) matrix with (1,3,1,3,1,3,...) on its main diagonal and (3,1,3,1,3,1,...) on its superdiagonal.at n=40A124572
- a(n) = 2*n*(6*n-1).at n=27A126964
- a(n) = n*(5*n-3).at n=42A135706
- Inverse binomial transform of A061037 (read as with offset 0).at n=9A144392
- 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, 1), (-1, 1, 1), (1, 0, 1), (1, 1, 0)}.at n=7A150709
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of 2 n steps taken from {(-1, -1), (-1, 0), (-1, 1), (1, -1), (1, 1)}.at n=5A151345
- Triangular array: the fusion of (x+1)^n and (x+2)^n; see Comments for the definition of fusion.at n=49A193722
- Mirror of the fusion triangle A193722.at n=50A193723
- 23 times triangular numbers.at n=27A195039
- Number of nX3 0..1 arrays with row sums equal and column sums unequal to adjacent columns.at n=7A202737
- T(n,k)=Number of nXk 0..1 arrays with row sums equal and column sums unequal to adjacent columns.at n=52A202742
- Number of simple labeled graphs on n nodes with exactly 6 connected components that are trees or cycles.at n=3A215856
- Number T(n,k) of simple labeled graphs on n nodes with exactly k connected components that are trees or cycles; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=51A215861
- Number of simple labeled graphs on n+3 nodes with exactly n connected components that are trees or cycles.at n=6A215863