9546
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
- 16
- Divisor Sum
- 20064
- Proper Divisor Sum (Aliquot Sum)
- 10518
- 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
- 3024
- Möbius Function
- 1
- Radical
- 9546
- 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
- 104
- 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
- a(n) = 1 + n/2 + 9*n^2/2.at n=46A006137
- Numbers whose base-2 representation has exactly 12 runs.at n=16A043579
- Positive integers n such that n^14 + 1 is semiprime (A001358).at n=38A104335
- Number of branches of length 1 in all hex trees with n edges.at n=7A126323
- Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS2(n, k) + StirlingS2(n, n-k)) with p=2 and q=1, read by rows.at n=46A154915
- Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS2(n, k) + StirlingS2(n, n-k)) with p=2 and q=1, read by rows.at n=53A154915
- Values of n such that n^a-+a are primes, a=5.at n=10A155021
- Erroneous version of A140763.at n=25A159579
- Numbers k such that k^3 +-7 are primes.at n=32A176685
- Number of strictly increasing arrangements of 4 nonzero numbers in -(n+2)..(n+2) with sum zero.at n=34A188123
- Square array A(n,k), n>=1, k>=1, read by antidiagonals: A(n,k) is 1/(2*n) times the number of n-colorings of the complete tripartite graph K_(k,k,k).at n=40A212221
- Number of (w,x,y) with all terms in {0,...,n} and w < R < 2*w, where R = range{w,x,y} = max(w,x,y)-min(w,x,y).at n=38A213400
- Number of nondecreasing -7..7 vectors of length n whose dot product with some lexicographically greater or equal nondecreasing -7..7 vector equals n.at n=4A226421
- T(n,k)=Number of nondecreasing -k..k vectors of length n whose dot product with some lexicographically greater or equal nondecreasing -k..k vector equals n.at n=59A226422
- Number of nondecreasing -n..n vectors of length 5 whose dot product with some lexicographically greater or equal nondecreasing -n..n vector equals 5.at n=6A226426
- n! mod n^3.at n=36A242427
- Number of (5+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=21A250659
- a(n) = 1/(2*n) times the number of n-colorings of the complete tripartite graph K_(k,k,k).at n=4A282247
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p that are < p/2.at n=19A282721
- a(n) = 3*a(n-1) - a(n-2) - 4*a(n-3) + 2*a(n-4) for n >= 4, where a(0) = 2, a(1) = 4, a(2) = 8, a(3) = 16, a(4) = 34, a(5) = 70 .at n=12A288170