17457
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
- 12
- Divisor Sum
- 26544
- Proper Divisor Sum (Aliquot Sum)
- 9087
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10120
- Möbius Function
- 0
- Radical
- 759
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 141
- 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
- a(n) = (n+1)*(n^2+n+2)/2; g.f.: (1 + 2*x^2) / (1 - x)^4.at n=32A006000
- a(n) = (2*n - 13)*n^2.at n=23A015246
- Fibonacci sequence beginning 1, 28.at n=15A022398
- Least term in period of continued fraction for sqrt(n) is 8.at n=38A031432
- Numbers n such that n | 9^n + 7^n + 5^n + 3^n.at n=19A063455
- Numbers n for which there are exactly ten k such that n = k + reverse(k).at n=9A072434
- Expansion of (1-x)/(1-x-x^2+2*x^3).at n=44A078011
- Partial sums of n 3-spaced triangular numbers beginning with t(3), e.g., a(2) = t(3)+t(6) = 6+21 = 27.at n=21A085788
- Erlang C queues type triangular sequence based on A122525.at n=18A137216
- Triangle T(n, k) = n^(n-1) * Fibonacci(k)^(n+1) - (n-1)! * (Fibonacci(k) - 1) * Sum_{j=0..n} (n*Fibonacci(k))^j/j!, with T(n, 0) = n! and T(n, 1) = n^(n-1), read by rows.at n=19A137227
- Greatest number m such that the fractional part of (101/100)^A153669(n) <= 1/m.at n=9A153673
- a(n) = 16n^2 + n.at n=32A157474
- a(n) = 1089*n^2 + 33.at n=4A158688
- For any number n take the polynomial formed by the product of the terms (x-pi), where pi's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is equal to zero.at n=38A203614
- Number of length n+5 0..2 arrays with some disjoint triples in each consecutive six terms having the same sum.at n=9A248062
- Number of partitions of 3n into exactly 4 parts.at n=45A256313
- Number of partitions of 5n into exactly 4 parts.at n=27A256327
- Odd numbers of the form (m*k)^2/(m^2-k^2) for distinct integers m and k.at n=15A259288
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 809", based on the 5-celled von Neumann neighborhood.at n=25A273612
- 35-gonal numbers: a(n) = n*(33*n-31)/2.at n=33A282851