17094
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 43776
- Proper Divisor Sum (Aliquot Sum)
- 26682
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- -1
- Radical
- 17094
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-1)/2.at n=25A047181
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-2)/2.at n=25A047192
- Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=17A054208
- a(n) = (n/2)*(n + 1)*(3*n + 11).at n=20A059997
- Numbers k such that phi(k) divides sigma(k+1) - sigma(k).at n=41A072611
- Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.at n=9A076252
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A126315/A126316.at n=12A127283
- a(n) = 1331*n - 209.at n=12A157444
- Expansion of x/((1-x)^3*(1-x^2)^3*(1-x^3)).at n=20A164680
- Number of steps to reach 1 in '3x+1' (or Collatz) problem starting with the n-th Mersenne prime.at n=14A181777
- Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others.at n=41A183898
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent cycles (0 <= k <= n). An adjacent cycle is a cycle of the form (i, i+1, i+2, ...) (including 1-element cycles).at n=60A184184
- Number of strings of numbers x(i=1..6) in 0..n with sum i^3*x(i)^2 equal to 216*n^2.at n=39A184307
- G.f. for Ehrhart quasi-polynomials for hyperplane arrangements of type E_6.at n=32A210634
- a(n) is the least value of k such that k*n uses only the digit 2, or a(n) = -1 if no such multiple exists.at n=12A216485
- Numbers k having at least two complementary pairs of divisors (q, p) and (p', q') such that k = p*q = p'*q' where the decimal digits of p' are the 9's complement of the decimal digits of p and the decimal digits of q' are the 9's complement of the decimal digits of q.at n=11A226587
- Numbers n for which n' + n and n' - n are both prime, n' being the arithmetic derivative of n.at n=40A229272
- Cyclops numbers whose squares are cyclops numbers.at n=29A239827
- Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00010101 or 01010101.at n=5A261289
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00010101 or 01010101.at n=4A261290