9258
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18528
- Proper Divisor Sum (Aliquot Sum)
- 9270
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3084
- Möbius Function
- -1
- Radical
- 9258
- Omega Function (Ω)
- 3
- 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
- 34
- 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 factorization patterns of polynomials of degree n over F_4.at n=19A006169
- a(n) = floor( n*(n-1)*(n-2)/27 ).at n=64A011909
- Convolution of Fibonacci numbers and A014306.at n=19A023614
- Convolution of (F(2), F(3), F(4), ...) and A014306.at n=18A023656
- Nonnegative numbers of the form n^3 (+/-) 3, n >= 0.at n=40A052276
- Iccanobirt prime indices (2 of 15): Indices of prime numbers in A102112.at n=10A102132
- Sum of ordered 3 prime sided prime triangles.at n=40A105100
- Sums of rows of the triangle in A116366.at n=37A116367
- Rectangular table, read by antidiagonals, defined by the following rule: start with all 1's in row zero; from then on, row n+1 equals the partial sums of row n excluding terms in columns k = m*(m+1)/2 (m>=1).at n=60A127054
- Diagonal of table A127054.at n=5A127056
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=40A213070
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.at n=38A214373
- Number of (n+2) X 6 0..2 matrices with each 3 X 3 subblock idempotent.at n=11A224602
- Number of partitions p of n that are disjoint from their conjugate.at n=54A240674
- G.f. satisfies: A(x) = A( x/A(x) )^2 / (1+x).at n=6A245307
- Number of (n+1) X (5+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=3A250794
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=31A250797
- Number of (4+1) X (n+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=4A250801
- Number of binary strings of length n+10 such that the smallest number whose binary representation is not visible in the string is 10.at n=7A261475
- Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=19A286795