16317
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 28158
- Proper Divisor Sum (Aliquot Sum)
- 11841
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9072
- Möbius Function
- 0
- Radical
- 777
- Omega Function (Ω)
- 5
- 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
- 66
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( phi*a(n-1) ) + floor( phi*a(n-2) ), where phi is the golden ratio.at n=14A005908
- a(n) = (2*n - 5)n^2.at n=21A015240
- Numbers whose base-5 representation has exactly 7 runs.at n=26A043607
- Triangle of coefficients of polynomials arising in enumeration of periodic sequences.at n=60A054722
- Number of n-bead necklace structures using exactly six different colored beads.at n=10A056299
- Number of primitive (period n) n-bead necklace structures using exactly six different colored beads.at n=10A056307
- a(n) = 3*n*(4*n-1).at n=37A062783
- Triangle read by rows: T(n, k) is the number of primitive (period n) n-bead necklace structures with k different colors. Only includes structures that contain all k colors.at n=60A107424
- Triangle read by rows: T(n,k) is the number of k-block partitions of an n-set up to rotations.at n=60A152175
- Numbers n such that n^6 + 272 is prime.at n=20A161998
- Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less.at n=17A221597
- Numbers m such that the result of prepending a zero digit to m, removing the least significant digit D, and prepending D, is divisible by m.at n=35A256005
- Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) * Product_{j>=i} 1/(1 - mu(j)^2*x^j), where mu() is the Moebius function (A008683).at n=32A284829
- Numbers k such that phi(x) = 12*k+2 is solvable, where phi is Euler's totient A000010.at n=23A289364
- Expansion of Product_{k>=1} (1 + x^(2*k-1))^(k*(k-1)/2).at n=32A294777
- Number of connected multiset partitions of normal multisets of size n.at n=8A317077
- Triangle read by rows: T(n,k) is the number of n-bead necklace structures which are not self-equivalent under a nonzero rotation using exactly k different colored beads.at n=60A327693
- Numbers m such that m = p^2 + k^2, with p > 0, where p = A007954(m) = the product of digits of m.at n=19A334557
- Numbers that are the sum of four third powers in six or more ways.at n=10A345148
- Numbers that are the sum of four third powers in exactly six ways.at n=9A345149