14195
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 3949
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10624
- Möbius Function
- -1
- Radical
- 14195
- Omega Function (Ω)
- 3
- 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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of strict first-order maximal independent sets in cycle graph.at n=33A007391
- Least term in period of continued fraction for sqrt(n) is 7.at n=23A031431
- a(n) = (2*n+1) * (4*n-1).at n=42A033566
- a(n) = RMS( A141393(0) through A141393(n) ).at n=16A141394
- 5 times heptagonal numbers: a(n) = 5*n*(5*n-3)/2.at n=34A153785
- a(n) = 49*n^2 + 2*n.at n=16A157365
- a(n) = 676*n - 1.at n=20A158393
- The cost of all leaves in the Fibonacci tree of order n.at n=15A178521
- Partial sum of Perrin numbers.at n=29A193744
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210601; see the Formula section.at n=48A210600
- Numbers k such that 19^k + k^19 - 1 is prime.at n=5A216422
- Number of partitions of n in which any two parts differ by at most 8.at n=40A218510
- Number of maximal independent vertex sets (and minimal vertex covers) in the n-antiprism graph.at n=14A290593
- Number of minimal total dominating sets in the wheel graph on n nodes.at n=33A302658
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=9A304852
- Number of minimal total dominating sets in the n-double cone graph.at n=14A362812
- Expansion of (1/x) * Series_Reversion( x / (1+x)^2 * (1-x^3) ).at n=8A369398