14381
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14652
- Proper Divisor Sum (Aliquot Sum)
- 271
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14112
- Möbius Function
- 1
- Radical
- 14381
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 61.at n=16A020400
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 21.at n=20A051986
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n-1)*Sum[Binomial[n-m, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=57A146772
- Number of partitions of 2n having twice as many odd parts as even.at n=24A239258
- Number of length n+5 0..2 arrays with at most two downsteps in every 5 consecutive neighbor pairs.at n=3A255619
- T(n,k)=Number of length n+k 0..2 arrays with at most two downsteps in every k consecutive neighbor pairs.at n=31A255622
- Number of length n+4 0..2 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=4A255626
- Numbers k such that (82*10^k + 161)/9 is prime.at n=25A271505
- The number of partitions of n in which at least one part is a multiple of 4.at n=37A295342
- Numbers k such that both k and k+2 are de Polignac numbers (A006285).at n=19A330284
- Triangle read by rows: T(n,k) is the number of sensed 2-connected (nonseparable) planar maps with n edges and k vertices, n >= 2, 2 <= k <= n.at n=59A342061
- Triangle read by rows: T(n,k) is the number of sensed 2-connected (nonseparable) planar maps with n edges and k vertices, n >= 2, 2 <= k <= n.at n=61A342061
- Number of unsensed simple planar maps with n vertices and 2 faces.at n=10A384967
- Number of unique nonempty strings with either 0 or 1 copies of a letter i_1, either 0 or 2 copies of a letter i_2, ..., either 0 or n copies of a letter i_n, where i_1, ..., i_n are all distinct letters.at n=3A389772