17306
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27540
- Proper Divisor Sum (Aliquot Sum)
- 10234
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8128
- Möbius Function
- -1
- Radical
- 17306
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 141
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Triangle read by rows: Each row is constructed by forming the partial sums of the previous row, reading from the right and at every third row repeating the final term.at n=41A099961
- a(n+1) = a(n) + (if a(n) is odd then (next odd square) else (next even square)), a(0) = 1.at n=24A116955
- Indices of prime numbers of trees with n unlabeled nodes.at n=14A119642
- Partial sums of A001676.at n=15A178579
- G.f. satisfies: A(x) = exp( Sum_{n>=1} x^n*A(x^n + x^(2*n))/n ).at n=9A192634
- Number of partitions of n in which the largest summand has frequency 1, the next largest summand has frequency at most 2, the third largest has frequency at most 3, etc.at n=41A244395
- Numbers n such that n!3 + 3^6 is prime.at n=27A247467
- Numbers k such that 3 is the smallest decimal digit of k^4.at n=40A291671
- Numbers with sum of digits equaling 17, divisible by 17, and containing the string "17".at n=3A346904
- a(n) is the largest number whose fourth power is an n-digit which has the maximum sum of digits (A373914(n)).at n=16A380797
- Expansion of ( (1/x) * Series_Reversion( x * ((1-x) * (1-x+x^2))^3 ) )^(1/3).at n=5A381831