17277
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
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24864
- Proper Divisor Sum (Aliquot Sum)
- 7587
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10608
- Möbius Function
- -1
- Radical
- 17277
- 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
- 128
- 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 nodes in regular n-gon with all diagonals drawn.at n=27A007569
- Base-5 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,2,3.at n=6A037675
- Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=36A039871
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p that are < p/2.at n=23A282721
- Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic nonresidues mod p that are < p/2.at n=27A282724
- Total number of binary digits in all partitions of n into distinct parts.at n=39A319140
- T(n,k) is the number of non-congruent maximal subsets of a grid of n X k lattice points (k <= n), such that no two points are at the same distance, and the points do not fit into a smaller grid. The size of the subsets is given by A351700. T(n,k) and A351700 are triangles read by rows.at n=74A351699
- Number of odd chordless cycles of length > 4 in the n-Mycielski graph.at n=5A362512
- The number of lit cells in weakly decreasing partitions of n when light shines from the north west. Here partitions are represented from left to right by columns of cells.at n=23A366157