10384
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 22320
- Proper Divisor Sum (Aliquot Sum)
- 11936
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4640
- Möbius Function
- 0
- Radical
- 1298
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- Hit polynomials.at n=5A001886
- a(n) = (1/6)*(2*n - 3)*(n + 2)*(n + 1).at n=33A058373
- Numbers k such that 7*2^k - 5 is prime.at n=32A058602
- Permutation of N induced by rotating the node 5 left in the infinite planar binary tree shown at A065658.at n=44A065669
- a(n) = floor(n^sqrt(n)).at n=12A066641
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if -1<=i-j<=1 else m(i,j)=1.at n=39A080018
- a(n) = A083964(n)/(2n-1).at n=11A083965
- a(n) = (p^2 - 1) / 12, where p is the n-th prime of the form 4*k+1.at n=33A109255
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 0110-1111-0110 pattern in any orientation.at n=11A146918
- Number of triangles that can be built from rods with lengths 1,2,...,n by using and concatenating all rods.at n=34A160455
- a(n) = (-1)^n*n*(n+1)*(2*n-5)/6.at n=31A167386
- Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts.at n=46A168659
- Partial sums of A030467.at n=4A173798
- Number of (n+1) X 3 binary arrays with every 2 X 2 subblock singular.at n=4A184679
- Number of (n+1)X6 binary arrays with every 2X2 subblock singular.at n=1A184682
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock singular.at n=19A184686
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock singular.at n=16A184686
- Irregular triangle of the square root of the sums of squares mentioned in A184763.at n=44A184886
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 3.at n=28A209986
- G.f. satisfies: A(x) = x + A(A(x)^2)^2 where g.f. A(x) = Sum_{n>=1} a(n)*x^(3*n-2).at n=6A212277