17064
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 48000
- Proper Divisor Sum (Aliquot Sum)
- 30936
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5616
- Möbius Function
- 0
- Radical
- 474
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 35
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=18A031785
- Numbers ending with '4' that are the difference of two positive cubes.at n=36A038859
- Numbers whose base-4 representation contains exactly three 0's and four 2's.at n=24A045056
- Triangle inverse to that in A046899.at n=40A046900
- McKay-Thompson series of class 39A for Monster.at n=49A058659
- Number of perfect powers (A001597) not exceeding 2^n.at n=28A070228
- Numbers with at least two 3s in their prime signature.at n=41A109399
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=30A116037
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=32A124140
- 8 times octagonal numbers: 8*n*(3*n-2).at n=27A153808
- a(n) = n*A007504(n)/2 = n*(sum of first n primes)/2.at n=27A156778
- a(n) = Sum_{d|n} d*2^(n/d)*tau(d).at n=13A174478
- Numbers of the form p^3*q^3*r where p, q, and r are prime.at n=27A179688
- Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=15A187158
- G.f. satisfies: A(x) = Product_{n>=1} (1 + x^n*A(x)^(1/2))^2/(1 - x^n*A(x)^(1/2))^2.at n=6A192619
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, five, six or eight distinct values for every i,j,k<=n.at n=6A211591
- a(n) = n^3 - floor(n/3)^3.at n=26A213039
- Number of functions on n unlabeled nodes in which all the components are distinct.at n=11A217861
- Number of (n+2)X(n+2) 0..2 arrays with no increasing sequence of length 3 horizontally or diagonally downwards.at n=0A233610
- Number of (n+2) X (1+2) 0..2 arrays with no increasing sequence of length 3 horizontally or diagonally downwards.at n=0A233611