17745
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 35136
- Proper Divisor Sum (Aliquot Sum)
- 17391
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- 0
- Radical
- 1365
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 79
- 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 tree-rooted planar maps with 3 faces and n vertices and no isthmuses.at n=11A006470
- a(n) is least k such that k and 6k are anagrams in base n (written in base 10).at n=19A023098
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=a(2)=1 and a(3)=7.at n=13A024733
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(2)=1 and a(3)=7.at n=12A024955
- a(n) = Sum_{k=0..n} (k+1) * A026637(n,k).at n=11A026970
- Family 1 "Rule 90 x Rule 150 Array" read by antidiagonals.at n=34A048710
- 2nd column of Family 1 "90 X 150 array": generations 0 .. n of Rule 150 starting from seed pattern 5.at n=6A048712
- A Jacobsthal-Lucas convolution.at n=13A099429
- Triangle read by rows: T(n,k) = binomial(2n+1, n-k)*Fibonacci(2k+1), 0 <= k <= n.at n=31A103245
- Larger members of primitive phi-amicable pairs.at n=13A121249
- Positions of zeros in A165597.at n=13A165598
- Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 9.at n=4A180289
- Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-4.at n=8A180294
- Lengths of binary representations of prime Fibonacci numbers.at n=27A215367
- Number of (n+3)X(4+3) 0..1 arrays with each row and column divisible by 15, read as a binary number with top and left being the most significant bits.at n=5A262453
- Number of (n+3)X(6+3) 0..1 arrays with each row and column divisible by 15, read as a binary number with top and left being the most significant bits.at n=3A262455
- T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column divisible by 15, read as a binary number with top and left being the most significant bits.at n=39A262457
- T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column divisible by 15, read as a binary number with top and left being the most significant bits.at n=41A262457
- Triangle T read by rows: T(n, m), for n >= 2, and m=1, 2, ..., n-1, equals the positive integer solution x of y^2 = x^3 - A(n, m)^2*x with the area A(n, m) = A249869(n, m) of the primitive Pythagorean triangle characterized by (n, m) or 0 if no such triangle exists.at n=73A278711
- Number of nX5 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=7A280601