17303
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20496
- Proper Divisor Sum (Aliquot Sum)
- 3193
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14520
- Möbius Function
- 0
- Radical
- 143
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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 directed animals of size n (or directed n-ominoes in standard position).at n=11A005773
- Triangular array that counts rooted polyominoes.at n=55A038622
- a(1)=7; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+4}^e_i.at n=23A045970
- Square array read by antidiagonals: number of ways a pawn-like piece (with the initial 2-step move forbidden and starting from any square on the back rank) can end at various squares on an infinite chessboard.at n=65A062105
- Triangle, read by rows, of pairwise sums of trinomial coefficients (A027907).at n=60A104029
- Numbers of the form (11^i)*(13^j).at n=11A108090
- Expansion of x * (x+1) * (x^3-x^2-1) / ((x^2+1) * (x^3+x^2-1)).at n=37A122519
- Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k DUUU's.at n=23A135308
- Numbers having exactly two distinct prime factors p, q with q = p+2.at n=42A143202
- Transform of C(n+1,floor((n+1)/2)) by A178112.at n=20A178113
- Numbers having factorization Product_{i=1..m} p(i)^e(i) such that m > 1 and p(i) + e(i) is the same for each i.at n=16A219302
- Number of 0..n arrays of length 5 with each element unequal to at least one neighbor, starting with 0.at n=10A221464
- a(n) = A222051(n)/binomial(2*n,n), the central terms in rows of triangle A220178 divided by the central binomial coefficients.at n=5A222052
- Numbers k such that between k and the next prime there are gpf(k) numbers, where gpf(k) denotes the largest prime factor of k.at n=14A235425
- Integer sequence induced by second order Bulgarian solitaire operation on partition list A241918: a(n) = A241909(A243072(A241909(n))).at n=27A243052
- Ulam numbers k such that 4*k and 16*k are also Ulam numbers.at n=25A287634
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(k*x)*(BesselI(0,2*x) + BesselI(1,2*x)).at n=76A292630
- 3d-congruent numbers: positive integers n for which there exists a trirectangular tetrahedron having volume n and rational areas and sides.at n=29A297207
- Number of valid hook configurations of permutations of [n] that avoid the patterns 231 and 1243.at n=12A307789
- Numbers k such that A276086(k) is a multiple of k.at n=52A328387