17366
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27480
- Proper Divisor Sum (Aliquot Sum)
- 10114
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8208
- Möbius Function
- -1
- Radical
- 17366
- 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
- 110
- 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
- Number of isomorphism classes of anti-associative closed binary operations on a set of order n, listed by class size.at n=15A079181
- Numbers k such that (2*k)!/(2*(k!)^2)+1 is prime.at n=44A112863
- Number of binary strings of length n with equal numbers of 00010 and 10010 substrings.at n=15A164221
- Left edge of the triangle in A033291.at n=37A192735
- G.f. A(x) satisfies: 1 = Sum_{n>=0} x^n*A(-x)^A002024(n+1), where A002024 is defined as "n appears n times.".at n=12A193039
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no element more than one greater than the previous.at n=39A199848
- Number of nondecreasing -n..n vectors of length 3 whose dot product with some nondecreasing -n..n vector equals 3.at n=23A226411
- Number of length n+3 0..n arrays with no four elements in a row with pattern abba (with a!=b) and new values 0..n introduced in 0..n order.at n=5A243382
- Number of length n+3 0..6 arrays with no four elements in a row with pattern abba (with a!=b) and new values 0..6 introduced in 0..6 order.at n=5A243387
- a(n) = Sum_{k=0..n} phi(k^2 + 1), where phi is the Euler totient function (A000010).at n=42A333170