17092
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 29918
- Proper Divisor Sum (Aliquot Sum)
- 12826
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8544
- Möbius Function
- 0
- Radical
- 8546
- Omega Function (Ω)
- 3
- 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
- 66
- 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
- Generalized Fibonacci numbers A_{n,4}.at n=35A006209
- a(n+1) = a(n) converted to base 7 from base 6 (written in base 10).at n=29A023384
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 66 ones.at n=30A031834
- McKay-Thompson series of class 14c for Monster.at n=15A058507
- Number of A095285-primes in range ]2^n,2^(n+1)].at n=17A095295
- Number of A095313-primes in range [2^n,2^(n+1)].at n=17A095333
- Number of nondecreasing integer sequences of length 17 with sum zero and sum of absolute values 2n.at n=13A158151
- Number of binary strings of length n with equal numbers of 00010 and 11100 substrings.at n=15A164227
- Number of 0..n arrays of length n+1 with no adjacent pair equal to its immediately preceding adjacent pair, and new values introduced in 0..n order.at n=7A212830
- a(n) = A216960(n)/2.at n=32A216961
- The number of distinct lines defined by an n X n X n grid of points.at n=4A222267
- Number of length n+2 0..5 arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=3A252174
- T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=31A252177
- Number of length 4+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=4A252180
- Expansion of Product_{k>=1} 1/(1 - (k - 1)*x^k).at n=21A319110
- Expansion of Product_{1 <= i < j} 1/(1 - x^(i*j)).at n=39A321285
- Expansion of Product_{i>=1, j>=1} 1 / (1 - x^(i*j*(j + 1)/2)).at n=28A327744
- Expansion of Product_{k>=1} (1 + x^k + x^(k+2)).at n=40A345729
- Numbers k such that the k-th composition in standard order is a non-alternating permutation of an initial interval of positive integers.at n=29A350250
- Decreasing partition array based on the fractional parts of tan(n); see Comments.at n=36A389579