14422
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21636
- Proper Divisor Sum (Aliquot Sum)
- 7214
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7210
- Möbius Function
- 1
- Radical
- 14422
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- a(1) = 3; a(n+1) = a(n)-th composite.at n=35A022451
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A002808 (composite numbers).at n=47A023863
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...).at n=22A024460
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (composite numbers).at n=46A024860
- First differences of A073708.at n=26A073709
- First differences of A073708.at n=27A073709
- Semiprimes in A056109.at n=30A113528
- Number of partitions of {1,...,2*n} into even sized blocks such that no block size is repeated.at n=6A115278
- The first 10 digits of the fourth root of n contain the digits 0-9.at n=2A119519
- a(n) = p(n)*p(n+2) - 3*p(n+1), where p(n) is the n-th prime.at n=29A152528
- Indices of pentagonal pyramidal numbers which are the sum of two other such numbers: k such that A002411(k) = A002411(i)+A002411(j) for some i,j>0.at n=28A172437
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) > number of parts of p.at n=45A241832
- Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=20A250723
- Number of n X n 0..1 arrays with every element equal to 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=6A298134
- Number of nX7 0..1 arrays with every element equal to 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=6A298138
- Number of (not necessarily maximal) cliques in the n-polygon diagonal intersection graph.at n=17A300524
- Number of nX4 0..1 arrays with every element equal to 0, 1 or 4 horizontally or vertically adjacent elements, with upper left element zero.at n=13A301658
- Expansion of 1/(1 - x) * Product_{k>=0} 1/(1 - x^(2^k))^(2^(k+1)).at n=13A321335
- a(n) = A178901(n)/n.at n=18A339711
- a(n) = binomial(n+3, 4) + binomial(n+1, 3) + 1.at n=22A368881