17206
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29520
- Proper Divisor Sum (Aliquot Sum)
- 12314
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7368
- Möbius Function
- -1
- Radical
- 17206
- 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
- yes
- Odd
- no
Appears in sequences
- Sums of 4 distinct powers of 7.at n=8A038483
- Numbers whose base-7 representation contains exactly four 1's.at n=33A043400
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 1 that start at an odd level.at n=47A102405
- Number of Dyck paths of semilength n having no ascents of length 1 that start at an odd level.at n=11A102407
- Product plus sum of four consecutive nonnegative numbers.at n=10A166941
- Number of ways to place 2 nonattacking nightriders on an n X n board.at n=13A172141
- Number of partitions of n into exactly 6 different parts with distinct multiplicities.at n=22A212117
- Numbers n such that n^8 + 1 and (n + 2)^8 + 1 are both prime.at n=37A217972
- Smallest number k >= A000043(n) such that k*A000668(n)*(k*A000668(n)+1)-1 is prime.at n=20A249509
- Expansion of Product_{k>=1} ((1 - x^(7*(2*k-1))) * (1 - x^(7*k)) / (1 - x^k)).at n=40A280937
- Number of semiprime Fermat pseudoprimes to base 2 (A214305) less than 10^n.at n=10A300418
- Number of integer partitions of n containing their multiset of multiplicities (as a submultiset).at n=51A325702
- Numbers k whose decimal representation can be split in three parts which can be used as seeds for a tribonacci-like sequence containing k itself.at n=22A383230