14368
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28350
- Proper Divisor Sum (Aliquot Sum)
- 13982
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7168
- Möbius Function
- 0
- Radical
- 898
- Omega Function (Ω)
- 6
- 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
- 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
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence).at n=39A024685
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence).at n=38A025118
- Number of partitions of n into parts not of the form 19k, 19k+2 or 19k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 8 are greater than 1.at n=41A035971
- McKay-Thompson series of class 26A for Monster.at n=30A058596
- Number of triangular regions in regular n-gon with all diagonals drawn.at n=29A062361
- Ramanujan numbers (A000594) read mod 16384.at n=21A126824
- Partial sums of A023200.at n=37A172112
- Number of distinct solutions of sum{i=1..4}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2.at n=11A180827
- Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix from A204114, given by gcd(L(i+1), L(j+1)), where L=A000032 (Lucas numbers).at n=22A204115
- Triangular array read by rows. T(n,k) is the number of sets of exactly k distinct binary words with a total of n letters.at n=37A208741
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having three distinct values for every i<=n and j<=n.at n=9A211498
- Number of contractible "tight" meanders of width n.at n=13A230439
- Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=4A234674
- Number of (n+1) X (5+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=0A234678
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=10A234681
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=14A234681
- Number of standard Young tableaux with n cells and exactly four successions.at n=7A241775
- Number of partitions of n into a squarefree number of squarefree parts.at n=47A286330
- Compound filter (2-adic valuation & sum of the divisors): a(n) = P(A001511(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=59A286460
- Sum of the fourth largest parts of the partitions of n into 10 squarefree parts.at n=52A326634