14728
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 31680
- Proper Divisor Sum (Aliquot Sum)
- 16952
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6288
- Möbius Function
- 0
- Radical
- 3682
- Omega Function (Ω)
- 5
- 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
- 133
- 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
- Coordination sequence for 4-dimensional I-centered tetragonal orthogonal lattice.at n=14A001386
- Number of rooted planar 2-trees with n nodes.at n=9A001895
- Number of local binary search trees (i.e., labeled binary trees such that every left child has a smaller label than its parent and every right child has a larger label than its parent) with n vertices such that the root has only one child.at n=6A100526
- Real part of absolute Gaussian perfect numbers, in order of increasing magnitude.at n=43A102531
- Numbers n with all digits different, such that all of its digits divide n, but none of the nonzero digits not in n divide n.at n=14A133606
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 00100-11111-00100 pattern in any orientation.at n=12A147010
- A Pascal triangle with an Eulerian-number shift: p(x,n)=If[n < 1, (x + 1)^(n + 1), (x + 1)^(n + 1) + (1 - x)^(n + 1)*PolyLog[ -n, x]].at n=58A147290
- A Pascal triangle with an Eulerian-number shift: p(x,n)=If[n < 1, (x + 1)^(n + 1), (x + 1)^(n + 1) + (1 - x)^(n + 1)*PolyLog[ -n, x]].at n=62A147290
- a(n) gives the number of conjugacy classes in the permutation group generated by transposition (1 2) and double n-cycle (1 3 5 7 ... 2n-1)(2 4 6 8 ... 2n). This group is a semidirect product formed by a cyclic group acting on an elementary abelian 2-group of rank n by cyclically permuting the factors.at n=17A178752
- (24n - 1)p(n): traces of partition class polynomials, with a(0) = -1.at n=11A183011
- Numbers divisible by at least four of their digits, different and >1.at n=36A187238
- Triangle read by rows. T(n, k) = coefficient of x^n in the Taylor expansion of [((1 - x - 2*x^2 - sqrt(1 - 2*x - 3*x^2))/(2*x^2))]^k.at n=56A202710
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 486", based on the 5-celled von Neumann neighborhood.at n=13A282604
- Numbers k such that 10^(2k)/2 + 10^k + 1 are prime.at n=9A296446
- a(n) = a(n-1) + a(n-2) + 2*a(floor(n/2)) + 3*a(floor(n/3)) + ... + n*a(floor(n/n)), where a(0) = 1, a(1) = 1, a(2) = 1.at n=15A298369
- Number of compositions of n whose run-lengths are either strictly increasing or strictly decreasing.at n=39A333191
- Numbers k such that the decimal expansion of k and 14^k both begin with 14.at n=25A352239
- Expansion of e.g.f. exp(exp(3*x)/3 - exp(x) + 2/3).at n=7A355396
- a(n) is the total sum of the last symbol in all Catalan words of length n avoiding the pattern (>=,>=).at n=11A382987