14512
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 28148
- Proper Divisor Sum (Aliquot Sum)
- 13636
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7248
- Möbius Function
- 0
- Radical
- 1814
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 58
- 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
- Number of connected partially ordered sets with n unlabeled elements.at n=8A000608
- T(2n,n+4), T given by A026780.at n=5A026897
- Number of ways to place non-intersecting diagonals in convex n-gon so as to create no triangles.at n=12A046736
- Expansion of e.g.f.: (1-x)/(2-exp(x)).at n=7A053525
- Number of partitions of n such that multiplicities of parts are divisors of n.at n=39A100932
- Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the line y=x (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)).at n=39A109979
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 1, 1), (1, -1, 0), (1, 0, 1), (1, 1, -1)}.at n=7A150871
- Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=16A192754
- Number of partitions of n in which the largest summand has frequency 1, the next largest summand has frequency at most 2, the third largest has frequency at most 3, etc.at n=40A244395
- Numbers k such that k + (sum of digits of k) and k + (product of digits of k) contain the same distinct digits of k.at n=11A248718
- Triangle read by rows: T(n,k) (n>=1, k>=1) is the number of posets with n elements whose Hasse diagram has k connected components.at n=28A263864
- Numbers k such that (5*10^k - 143)/3 is prime.at n=23A271821
- a(n) = Sum_{k=1..n} (-1)^(n-k) * Stirling1(n,k) * floor(n/k).at n=6A309910
- a(n) is the number of time-dependent assembly trees satisfying the connected gluing rule for a cycle on n vertices.at n=6A317057
- Triangle read by rows. T(n,k) is the number of labeled threshold graphs on n vertices with k components, for 1 <= k <= n.at n=21A348436