17339
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19824
- Proper Divisor Sum (Aliquot Sum)
- 2485
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14856
- Möbius Function
- 1
- Radical
- 17339
- 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
- 128
- 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) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) - 1 is prime, a(1) = 1.at n=22A046809
- Number of 4 X n binary arrays with a path of adjacent 1's and no path of adjacent 0's from top row to bottom row.at n=3A069418
- Number of n X 4 binary arrays with a path of adjacent 1's and no path of adjacent 0's from top row to bottom row.at n=3A069424
- Fibonacci sequence beginning 12, 67.at n=13A091074
- McKay-Thompson series of class 36g for the Monster group.at n=44A103262
- a(n) = 60*n^2 - 1.at n=16A158670
- Number of n-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero.at n=5A208817
- Number of n-bead necklaces labeled with numbers -6..6 allowing reversal, with sum zero.at n=5A208823
- T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero.at n=60A208825
- Number of 6-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero.at n=5A208827
- Dimensions of the plactic subalgebra of the Hopf algebra PMN_1.at n=4A231489
- T(n,k) is the total number of levels in all Dyck paths of semilength n containing exactly k path nodes; triangle T(n,k), n>=0, 1<=k<=n+1, read by rows.at n=57A371928