17708
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 32760
- Proper Divisor Sum (Aliquot Sum)
- 15052
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8352
- Möbius Function
- 0
- Radical
- 8854
- Omega Function (Ω)
- 4
- 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
- 97
- 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
- a(n) = Fibonacci(n) - 3. Number of total preorders.at n=18A006327
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 14.at n=19A031692
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 4).at n=47A035548
- Numbers whose base-5 representation contains exactly three 1's and three 3's.at n=25A045247
- Numbers n such that h(n) = 2 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)at n=20A078419
- a(n) = Fibonacci(4n+2) - 3.at n=4A081075
- Graded dimension of the space of invariant bilinear forms on the free pre-Lie algebra on one generator.at n=12A098091
- Numbers n such that n+prime(n) is the square of a prime.at n=10A104911
- Numbers n such that prime(n) + n is a prime power (A246547).at n=17A109314
- Larger cube root in set of successive minima of A^(1/3) + B^(1/3) - C (A,B,C positive integers; A,B not cubes).at n=16A129376
- a(n) = 361*n^2 + 19.at n=7A158592
- Positions of zeros in A165597.at n=7A165598
- a(n) = 49*n^2 + n.at n=18A173141
- The non-common part of the smaller number of an amicable pair.at n=16A180326
- Ordered differences of even-indexed Fibonacci numbers.at n=46A205448
- Number of (n+1)X3 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.at n=2A206615
- Number of (n+1)X4 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.at n=1A206616
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.at n=7A206621
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.at n=8A206621
- Number of (n+2) X (3+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 1 and no column sum 1.at n=19A257442