9468
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
- 18
- Divisor Sum
- 24024
- Proper Divisor Sum (Aliquot Sum)
- 14556
- 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
- 3144
- Möbius Function
- 0
- Radical
- 1578
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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-gons with n vertices.at n=7A000940
- Erroneous version of A000940.at n=7A004577
- Number of lines through exactly 6 points of an n X n grid of points.at n=51A018813
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CAS = Cesium Aluminosilicate (Araki) Cs4[Al4Si20O48] starting with a T1 atom.at n=12A019088
- (d(n)-r(n))/5, where d = A026046 and r is the periodic sequence with fundamental period (1,0,4,0,0).at n=48A026048
- Number of partitions of n in which the least part is even.at n=43A026805
- Numbers which are the sum of their proper divisors containing the digit 7.at n=8A059466
- Expansion of (1+x^2)*(1+x^5)/( Product_{j=1..7} (1-x^j) ).at n=35A060962
- a(0)=1, a(n) is the smallest integer >= a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals the number of elements in this continued fraction.at n=47A070900
- Bisection of A000940.at n=3A094157
- Odd squares written backwards and sorted.at n=42A107313
- Expansion of 1/(1 - x^4 - x^5 - x^6 + x^10).at n=54A147652
- Triangle read by rows: T(n,m) = (-1)^n*Sum_{i=0..m} (-1)^(m-i)*binomial(n-i-1, m-i)*Stirling_1(n+i+1,i+1), for 0 <= m <= n.at n=22A156528
- Number of (n+1)X5 0..1 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock differing from the number in all its horizontal and vertical neighbors.at n=11A205068
- Square array read by upwards antidiagonals: T(m,n) is the number of simple 3-connected triangulations of a closed region in the plane with m+3 given external edges and 3n+m internal edges, m>=0, n>=1.at n=49A210664
- T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..1 nXk array.at n=46A218842
- Unmatched value maps: number of 2 X n binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..1 2 X n array.at n=8A218843
- G.f. satisfies A(x) = 1 + x*A(x)^2*(1 + A(x))^2/2.at n=5A219538
- E.g.f. satisfies: A'(x) = A(x*A(x)) with A(0)=1.at n=7A231868
- Riordan array read by rows, corresponding to g.f. (1+x*y^3)/((1-x-y)*(1+x*y^3)+x*y^4).at n=47A239102