17594
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27840
- Proper Divisor Sum (Aliquot Sum)
- 10246
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8316
- Möbius Function
- -1
- Radical
- 17594
- 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
- 35
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = n OR n^3 (applied to binary expansions).at n=25A008468
- Number of parts in all the compositions of n into Fibonacci numbers (i.e., in all ordered sequences of Fibonacci numbers having sum n; only one 1 is considered as a Fibonacci number).at n=12A121551
- The (1,1)-entry in the matrix M^n, where M is the 7 X 7 Cartan matrix [2,-1,0,0,0,0,0; -1,2,-1,0,0,0,0; 0,-1,2,-1,0,0,-1; 0,0,-1,2,-1,0,0; 0,0,0,-1,2,-1,0; 0,0,0,0,-1,2,0; 0,0,-1,0,0,0,2].at n=9A125501
- Sequence generated from the E6 Cartan matrix.at n=9A126567
- Top-left "head" entry of the n-th power of the E8 Cartan matrix.at n=9A126569
- a(n) = 1 + 85*n + 2232*n^2 + 15276*n^3.at n=0A167190
- a(n) = Sum_{k=0..n} A109613(k)*A005843(n-k).at n=37A171218
- Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first differences in -n..n.at n=36A208995
- Number of n X 4 0..1 arrays with rows and columns unimodal.at n=4A223616
- Number of n X 5 0..1 arrays with rows and columns unimodal.at n=3A223617
- T(n,k) = Number of n X k 0..1 arrays with rows and columns unimodal.at n=31A223620
- T(n,k) = Number of n X k 0..1 arrays with rows and columns unimodal.at n=32A223620
- Number of n X n 0..3 matrices with each 2 X 2 subblock idempotent.at n=10A224660
- Numbers k such that [prime(k), prime(k+1), prime(k+2)] = [1, 2, 3] mod 11.at n=25A302767
- Triangle read by rows: T(n,k) is the number of n-bead necklace structures with beads of exactly k colors and no adjacent beads having the same color.at n=71A327396
- a(n) = 1 + Sum_{k=0..n-1} 2^k * binomial(n-1,k) * a(k) * a(n-1-k).at n=5A386298