9366
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21504
- Proper Divisor Sum (Aliquot Sum)
- 12138
- 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
- 2664
- Möbius Function
- 1
- Radical
- 9366
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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 necklaces of partitions of n+1 labeled beads.at n=6A000629
- Expansion of 1/(1 - x*exp(x) + x^2*exp(2*x) - x^3*exp(3*x)).at n=6A003017
- Convolution of natural numbers n >= 1 with Lucas numbers L(k) for k >= -2.at n=17A033818
- Numbers whose maximal base-8 run length is 4.at n=28A037995
- Numbers having four 2's in base 8.at n=13A043432
- Erroneous version of A002050.at n=5A047782
- E.g.f. A(x) satisfies A(x) = 1 + x * A(exp(x) - 1).at n=6A048801
- Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).at n=27A054255
- Number of squares (of another matrix) in the group GL(2,Z_n) described in sequence A000252.at n=11A068516
- Triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} defined by a(0,0)=1, a(n,0)=A000670(n), a(n,n)=A000629(n), a(n,k) = a(n,k-1) + a(n-1,k-1); a(n+1,0) = Sum_{k=0..n} a(n,k).at n=27A073146
- a(n) = Sum_{k>=0} k^n/2^k.at n=6A076726
- Matrix product of Stirling2-triangle A008277(n,k) and unsigned Stirling1-triangle |A008275(n,k)|.at n=21A079641
- Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k.at n=21A090665
- Largest member of the n-th row of the triangular triangle (A093445).at n=35A093446
- Triangle T(n,k), 0<=k<=n, read by rows, given by [1, 2, 2, 4, 3, 6, 4, 8, 5, 10, 6, 12, . . . ] DELTA [2, 1, 4, 2, 6, 3, 8, 4, 10, 5, 12, 6, . . . ] where DELTA is the operator defined in A084938.at n=27A108694
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=20A118156
- "666" in bases 7 and higher rewritten in base 10.at n=32A121205
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A127291/A127292.at n=10A127294
- T(n, k) = [x^k] Sum_{k=0..n} Stirling2(n, k)*RisingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n.at n=29A129062
- Triangle, read by rows, equal to the matrix cube of triangle P = A135880.at n=23A135888