17187
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24336
- Proper Divisor Sum (Aliquot Sum)
- 7149
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10752
- Möbius Function
- -1
- Radical
- 17187
- 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
- 27
- Smith Number
- yes
- 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
- Positive numbers k such that k and 4*k are anagrams in base 9 (written in base 9).at n=23A023081
- Numbers whose base-7 representation has exactly 6 runs.at n=26A043621
- Numbers k such that 2^k + 3 is prime.at n=31A057732
- a(n) = n^4 - 10n^3 + 35n^2 - 48n + 23.at n=13A137864
- Numbers of the form 26+p^2 (where p is a prime).at n=31A138689
- This sequence and A139143 are complements. a(1) = 1, A139143(1) = 2, a(n+1) = a(n) + Sum_{k = 1..n} A139143(k).at n=43A139142
- Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array C(t,r) read by rows.at n=29A177020
- a(n) = (11*5^n-1)/2.at n=5A198771
- Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=26A306197
- Numbers that are the sum of 4 nonzero 4th powers in more than one way.at n=34A309763
- Sum of the largest parts of the partitions of n into 9 parts.at n=35A326473
- Numbers that are the sum of four fourth powers in exactly two ways.at n=33A344193
- Record terms of A349664.at n=25A349665
- a(n) is the largest number that is not the sum of distinct n-gonal pyramidal numbers.at n=10A352350
- Triangle read by rows: T(n,k) = number of free polyominoes with n cells, where the maximum number of collinear cell centers on any line in the plane is k.at n=69A377942