14343
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 7545
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8184
- Möbius Function
- -1
- Radical
- 14343
- 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
- 76
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (primes).at n=20A024597
- Expansion of 1/((1-2x)(1-3x)(1-5x)(1-7x)).at n=4A025931
- Values of A038005 ending in 3.at n=13A038013
- Grundy function for turn-at-most-6-coins game.at n=26A054043
- Positions of check bits in code in A075937.at n=12A075939
- "Stirling-Bernoulli transform" of Pell numbers.at n=6A105797
- Integers i such that 41*i = 105 X i.at n=16A115876
- Triangle read by rows: T(n,k) = p(k)*T(n-1,k) + T(n-1,k-1) (1 <= k <= n), where p(k) denotes the k-th prime.at n=31A124960
- a(n) is the number whose binary representation is A138145(n).at n=13A147596
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,1,0,0 for x=0,1,2,3,4.at n=10A197312
- a(n) is the number of representative three-color bracelets (necklaces with turn over allowed) with n beads for n >= 3.at n=10A214307
- Numbers whose binary representation is palindromic and in which all runs of 0's and 1's have length at least 2.at n=45A222813
- Numbers k such that k!/(k-2) - 1 is prime.at n=23A291322
- Expansion of Product_{k>=1} B(x^k), where B(x) is the g.f. of A003106.at n=42A327691
- a(n) is the greatest nonnegative number which has a partition into a triangular number (A000217), a square number (A000290), and a pentagonal number (A000326) in n different ways.at n=49A327792
- Sum of all integers m satisfying Omega(m) = n and pi(p) <= n for all prime factors p of m.at n=4A332967
- A(n,k) is the sum of all compositions [c_1, c_2, ..., c_k] of n into k nonnegative parts encoded as Product_{i=1..k} prime(i)^(c_i); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=40A343751
- Starts of runs of 4 consecutive Gray-code Niven numbers (A344341).at n=20A344344
- Number of chordless cycles (of length >=4) in the complement of the n-Mycielski graph.at n=5A364994
- Numbers of the form A073138(k) XOR A038573(k).at n=45A380544