17056
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
- 24
- Divisor Sum
- 37044
- Proper Divisor Sum (Aliquot Sum)
- 19988
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7680
- Möbius Function
- 0
- Radical
- 1066
- Omega Function (Ω)
- 7
- 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
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 65.at n=30A031563
- Numbers whose base-4 representation contains exactly four 0's and three 2's.at n=24A045060
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047140.at n=15A047141
- Denominators of convergents to Pi by Farey fractions.at n=18A063673
- Integers that are Rhonda numbers to more than one base.at n=34A100988
- Number of partitions of n into parts but with two kinds of parts of sizes 1 to 10.at n=19A103929
- a(n) = 10*a(n-1) - 12*a(n-2) for n > 1; a(0) = 1, a(1) = 4 .at n=5A152599
- Number of permutations of length n with no consecutive triples i,i+d,i+2d (mod n) for all d.at n=4A174081
- Number of (n+2)X(n+2) 0..1 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum.at n=2A257353
- Number of (n+2)X(3+2) 0..1 arrays with no 3x3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum.at n=2A257356
- T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with no 3 X 3 subblock diagonal sum equal to the antidiagonal sum or central row sum less than the central column sum.at n=12A257361
- G.f. A(x) satisfies: 1 = ...(((((A(x) - x^2)^(1/2) - x^3)^(1/2) - x^4)^(1/2) - x^5)^(1/2) - x^6)^(1/2) -...- x^n)^(1/2) -..., an infinite series of nested square roots.at n=15A275691
- Expansion of 1/(1 + x + x/(1 + x^2 + x^2/(1 + x^3 + x^3/(1 + x^4 + x^4/(1 + ...))))), a continued fraction.at n=38A292854
- Expansion of g.f. A(x) satisfying 0 = Sum_{k=0..n} (-1)^k * binomial(2*n-k,k) * ([x^k] A(x)^n) for n >= 1.at n=6A375450