9246
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19584
- Proper Divisor Sum (Aliquot Sum)
- 10338
- 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
- 2904
- Möbius Function
- 1
- Radical
- 9246
- 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
- 153
- 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
- Erroneous version of A174319.at n=6A002934
- Number of subsets of { 1, ..., n } containing an arithmetic progression of length 4.at n=14A018789
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=29A024590
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=28A025104
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(2,5) < cn(3,5) = cn(4,5).at n=76A036853
- Molien series for 3-D group R4.at n=16A037243
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.at n=29A049791
- Numbers k such that k | sigma_11(k).at n=25A055715
- Triangle, read by rows, where column k equals column 0 of A113983^(k+1): T(n,k) = [A113983^(k+1)](n-k,0) for n>=k>=0.at n=60A113993
- Number of forests of rooted trees with total weight n, where a node at height k has weight 2^k (with root considered to be at height 0).at n=37A115593
- 6 times octagonal numbers: a(n) = 6*n*(3*n-2).at n=23A153796
- First differences of A160644.at n=31A160646
- a(n) = A066186(n) - A004125(n).at n=18A162362
- The even composites c such that c=q*g*j*y and q+g=j*y where q,g,j,y are primes.at n=25A167690
- Number of n-step walks on cubic lattice (no points repeated, no adjacent points unless consecutive in path).at n=6A174319
- G.f.: 1/(1-x) = Sum_{n>=0} a(n) * x^n / Product_{k=1..2*n} (1 + k*x).at n=5A208831
- a(n) = 5*n^2 + 1.at n=43A212656
- Number of partitions p of n such that n - 2*(number of parts of p) is a part of p.at n=48A238629
- Number of partitions p of n such that n - 2*(number of parts of p) is a part of p.at n=49A238629
- Number of (2+1) X (n+1) 0..1 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=10A253436