17645
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21180
- Proper Divisor Sum (Aliquot Sum)
- 3535
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14112
- Möbius Function
- 1
- Radical
- 17645
- 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
- 48
- 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
- Number of planted planar trees (n+1 nodes) where any 2 subtrees extending from the same node are different.at n=12A032027
- The number of distinct parts in the partition sequence lambda(n) formed by the recurrence lambda(1) = 1 and lambda(n+1) is the sum of lambda(n) and its conjugate.at n=29A064660
- Expansion of 1/(sqrt(1-4*x) - x^2).at n=8A104625
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, -1, 1), (0, 1, 0), (1, 0, -1)}.at n=10A148171
- Partial sums of A152891.at n=9A152895
- Number of (n+1)X(1+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=5A233372
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=20A233374
- Number of partitions of n where the difference between consecutive parts is at most 6.at n=38A238866
- Number of partitions of n such that (maximal multiplicity of parts) > (multiplicity of the least part).at n=42A240304
- The number of partitions of n without repeated odd parts having more even parts than odd parts.at n=50A340623
- Odd semiprimes p*q, such that Stern polynomial B(p*q,x) is a product of B(p,x) and B(q,x).at n=42A391256