17473
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17748
- Proper Divisor Sum (Aliquot Sum)
- 275
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 17200
- Möbius Function
- 1
- Radical
- 17473
- Omega Function (Ω)
- 2
- 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
- 141
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 85.at n=15A020424
- Numbers whose set of base-16 digits is {1,4}.at n=28A032828
- Numbers whose base-4 representation contains exactly four 0's and four 1's.at n=13A045037
- Number of compositions (ordered partitions) of n into powers of 4.at n=32A087221
- G.f. satisfies A(x) = f(x)^2 + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).at n=10A087224
- a(n) is the minimal area of a convex lattice polygon with 2n sides.at n=48A089187
- Numbers n such that sigma_3(n) is divisible by square of cototient of n, while n is not a prime number.at n=13A091286
- Take an n X n square grid of points in the plane; a(n) = number of non-isomorphic ways to divide the points into two sets using a straight line.at n=25A116696
- Least k such that n^k mod k = n + 1.at n=25A128172
- a(n) = least k such that the remainder when 27^k is divided by k is n.at n=27A128367
- a(n) = A145818(2n-1).at n=42A145850
- Composite numbers k for which k - phi(k) divides k-1.at n=11A160599
- a(0)=-4; a(n+1) = 2*a(n) + period 4: repeat 6,1,2,5.at n=18A180343
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..1 array extended with zeros and convolved with 1,1,1.at n=23A222431
- Number of 3 X n 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=12A224147
- Numbers n for which the numbers 6n+1, 3n+2, 6n+7 are all odd composite squarefree numbers, but none are semiprimes.at n=27A263510
- Number of compositions (ordered partitions) of n into squares dividing n.at n=32A294105
- Numbers n such that there is precisely 1 group of order n, 2 of order n + 1 and 3 of order n + 2.at n=10A296024
- Triangle read by rows, T(n, k) = A000262(n) - A349776(n, n - k) for n > 0 and T(0, 0) = 1.at n=33A349780
- a(n) is the number of reducible monic cubic polynomials x^3 + r*x^2 + s*x + t with integer coefficients bounded by naïve height n (abs(r), abs(s), abs(t) <= n).at n=34A358398