14001
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 6159
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8592
- Möbius Function
- -1
- Radical
- 14001
- 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
- 32
- 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 partitions of n into parts not of the form 17k, 17k+4 or 17k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=38A035965
- Numbers whose base-7 representation contains exactly four 5's.at n=21A043416
- Surround numbers of an n X 1 rectangle.at n=10A060633
- A Wallis pair (x,y) satisfies sigma(x^2) = sigma(y^2); sequence gives y's for indecomposable Wallis pairs with x < y (ordered by values of x).at n=28A075769
- a(n) = (2*n)!*(Integral_{x=0..sqrt(2/3)} 1/(1-x^2)^(n+1/2) dx)/((n!*2^n)*sqrt(2)).at n=4A089155
- 45-gonal numbers: n*(43*n-41)/2.at n=25A098924
- 4-Smith numbers.at n=14A103125
- Number of base 9 n-digit numbers with adjacent digits differing by one or less.at n=8A126363
- L.g.f.: A(x) = log( Sum_{n>=0} n^n*x^n ) = Sum_{n>=1} a(n)*x^n/n.at n=4A141151
- Maximum coefficient of the polynomial (-1)^(n+1)*Product_{k=1..n} (1 - x^k)^2.at n=25A156082
- a(n) = 400 * n + 1.at n=34A158313
- Number of n X n binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=8A188860
- Number of n X 8 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=7A188865
- A239461(n) / n^2.at n=13A239464
- Number of length n+5 0..2 arrays with at most one downstep in every 5 consecutive neighbor pairs.at n=5A255104
- Number of length n+6 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=4A255113
- Number of (n+2) X (2+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=9A259766
- Number of non-abelian groups of order prime(n)^6.at n=17A271811
- Triangle I(m,n) read by rows: number of perfect lattice paths on the m*n board.at n=43A296449
- Odd composite integers m such that A052918(3*m-J(m,29)) == 5 (mod m), where J(m,29) is the Jacobi symbol.at n=45A340237