14300
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 36456
- Proper Divisor Sum (Aliquot Sum)
- 22156
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 1430
- Omega Function (Ω)
- 6
- 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
- 50
- 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
- Degrees of irreducible representations of Suzuki group Suz.at n=11A003902
- Positive numbers k such that k and 2*k are anagrams in base 5 (written in base 5).at n=11A023061
- Number of partitions of n with equal number of parts congruent to each of 0, 3 and 4 (mod 5).at n=53A035577
- Convolution of A007054 (super ballot numbers) with A000984 (central binomial coefficients).at n=7A038665
- Number of n-dimensional partitions of 6.at n=12A042984
- a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).at n=8A065346
- Rearrangement of positive integers so that the successive ratios (of the larger to the smaller term) are all distinct integers. a(m)/a(m-1) = a(k)/a(k-1) iff m = k (assuming a(m) > a(m-1), otherwise the ratio a(m-1)/a(m) is to be considered). Priority is given to smallest number not included earlier rather than to the successive ratio that has not occurred earlier.at n=34A084337
- G.f.: (1+x^2)^2*(x^4-6*x^3+1)/(x^2-1)^4.at n=44A115046
- A tabular sequence of arrays counting ordered factorizations over least prime signatures. The unordered version is described by sequence A129306.at n=39A131420
- a(n) = A000010(n) * A002088(n).at n=45A143231
- a(n) = n*(n+1)*(5*n+7)/6.at n=25A162148
- Number of ways to place 2 nonattacking amazons (superqueens) on an n X n board.at n=13A172200
- Expansion of 3F2( (1/4,1/2,3/4); (4,6) )(256 x).at n=4A185247
- Numbers n having at least two distinct symmetrical pairs of divisors (a, b) and (b', a') such that n = a*b = b'*a' with a' = reverse(a) and b' = reverse(b).at n=27A228164
- Number of (n+1) X (5+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=10A235286
- Number of perfect partitions in graded colexicographic order.at n=42A238962
- Number of perfect partitions in canonical order.at n=42A238975
- Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 3 where empty bins are permitted (m >= 1, 1 <= n <= 3m).at n=35A248845
- Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=20A254904
- a(n) = (2+[n/2])*n!/((1+[n/2])*[n/2]!^2).at n=16A275329