17565
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
- 8
- Divisor Sum
- 28128
- Proper Divisor Sum (Aliquot Sum)
- 10563
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- -1
- Radical
- 17565
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 172
- 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
- no
- Odd
- yes
Appears in sequences
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={2}.at n=13A080009
- Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 3Xn array.at n=9A220155
- a(n) = Sum_{i=0..n} digsum_6(i)^4, where digsum_6(i) = A053827(i).at n=25A231675
- Longest word T from 2 equal length strings S using no breakpoint reuse.at n=20A280430
- Number of nX4 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A299550
- Number of nX6 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299552
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=39A299554
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=41A299554
- Number of simple graphs on n nodes with no cycle of length 5.at n=9A345216