17075
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 21204
- Proper Divisor Sum (Aliquot Sum)
- 4129
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13640
- Möbius Function
- 0
- Radical
- 3415
- 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
- 172
- 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
- no
- Odd
- yes
Appears in sequences
- Number of positions that are exactly n moves from the starting position in the Bicube or Bandaged Rubik's Cube puzzle.at n=13A079771
- Expansion of (1 + 2*x^3)/(1 - x - 4*x^7).at n=28A098528
- Number of solutions to rev(x^2) = rev(x)^2 with n digits, where the rev(x) function reverses the digits of x.at n=11A098701
- a(n) = the number of values of k <= 10^n such that sqrt(k*(k+1)*(k+2)*(k+3)+1) is prime.at n=5A115366
- Number of pairs of primes p < q such that (p+q)/2 = A002110(n), the n-th primorial.at n=6A147517
- a(n) = (2*n^3 + 5*n^2 - 9*n)/2.at n=24A162258
- Number of sequences of n integers p(i) i=0..n-1 with 0 <= p(i) <= 4*i and |p(i) - p(i-1)| <= 4.at n=5A180900
- T(n,k)=number of sequences of n integers p(i) i=0..n-1 0<=p(i)<=k*i and |p(i+1)-p(i)|<=k.at n=41A180906
- Number of 5 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=9A229448
- Number of partitions p of n such that (maximal multiplicity of the parts of p) > (number of distinct parts of p).at n=40A240309
- Number of nX6 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=2A240411
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=30A240412
- Number of 3Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=5A240414
- Partial sums of A299256.at n=22A299262
- Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=16A306197
- a(n) = Sum_{k=1..n} (k/gcd(n, k))^2.at n=44A332654
- Binomial transform of A339399(n).at n=13A350325