16343
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16680
- Proper Divisor Sum (Aliquot Sum)
- 337
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16008
- Möbius Function
- 1
- Radical
- 16343
- 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
- 97
- Smith Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (composite numbers).at n=25A025081
- a(n) = T(n, n+3), T given by A027052.at n=12A027054
- a(n) = prime(n) * prime(prime(n)).at n=16A073065
- Product of twin-prime-indexed primes and their lower bound twin prime.at n=6A080698
- Numbers k such that the k-th prime is of the form 2*j^2 + 1.at n=41A090612
- a(n) = 4*2^n - 3*n - 5.at n=12A109363
- Let f(p,i) = smallest prime m >= p such that m == i (mod p); a(n) = Sum_{i=0..p-1} f(p,i), where p = n-th prime.at n=16A243076
- Composites c for which an integer 1 < k < c exists such that (c-k)! == -1 (mod c).at n=32A256519
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood.at n=13A285839
- Number of compositions of n where the smallest part is smaller than the number of parts.at n=14A348124
- Number of rucksack partitions of n: every consecutive constant subsequence has a different sum.at n=46A353864