17036
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
- 6
- Divisor Sum
- 29820
- Proper Divisor Sum (Aliquot Sum)
- 12784
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8516
- Möbius Function
- 0
- Radical
- 8518
- Omega Function (Ω)
- 3
- 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
- 128
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = A026637(2*n, n).at n=8A026638
- a(n) = A026637(n, floor(n/2)).at n=16A026643
- Base-8 palindromes that start with 4.at n=28A043024
- Iccanobirt numbers (7 of 15): a(n) = R(a(n-1)) + R(a(n-2)) + R(a(n-3)), where R is the digit reversal function A004086.at n=17A102117
- Compositions of n into parts 3, 4 and 7.at n=44A245368
- Linear recurrence, with both signature and original terms = 1,0,1,0,1.at n=25A271970
- Number of nX5 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,-1) and new values introduced in order 0..2.at n=3A275263
- T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,-1) and new values introduced in order 0..2.at n=31A275266
- Number of 4 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,-1) and new values introduced in order 0..2.at n=4A275268
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n-1)*b(n), where a(0) = 3, a(1) = 4, b(0) = 1, b(1) = 2, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=10A296283
- Numbers k such that 373*2^k+1 is prime.at n=13A323027
- Numbers k such that the k-th composition in standard order is a permutation (of an initial interval).at n=47A333218
- Numbers k such that the k-th composition in standard order is an alternating permutation of {1..k} for some k.at n=19A349051
- The fixed points of A355702.at n=44A356017
- Triangle read by rows: T(n,k) is the number of k-critical graphs with n vertices and degree k, (4 <= k <= n).at n=38A389841