16737
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
- 25536
- Proper Divisor Sum (Aliquot Sum)
- 8799
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9552
- Möbius Function
- -1
- Radical
- 16737
- 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
- 66
- 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
- a(n) = n*(19*n - 1)/2.at n=42A022276
- Multiplicity of highest weight (or singular) vectors associated with character chi_8 of Monster module.at n=43A034396
- a(n) = Sum_{k=0..floor(n/4)} binomial(n-2k, 2k)*2^(n-4k).at n=12A100131
- Triangle read by rows: odd-numbered rows of A106580.at n=68A106595
- A Pell convolution.at n=12A113727
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 0,5,0,1,1,1,1 for x=0,1,2,3,4,5,6.at n=8A198056
- Number of (n+1) X (n+1) -8..8 symmetric matrices with every 2 X 2 subblock having sum zero and one or two distinct values.at n=15A211466
- Number of length n+2 0..n arrays with no three unequal elements in a row and new values 0..n introduced in 0..n order.at n=9A243634
- Number of length n+2 0..6 arrays with no three unequal elements in a row and new values 0..6 introduced in 0..6 order.at n=9A243637
- Number of length n+2 0..7 arrays with no three unequal elements in a row and new values 0..7 introduced in 0..7 order.at n=9A243638
- Number of length n+2 0..8 arrays with no three unequal elements in a row and new values 0..8 introduced in 0..8 order.at n=9A243639
- Number of length n+2 0..9 arrays with no three unequal elements in a row and new values 0..9 introduced in 0..9 order.at n=9A243640
- The number of ways to write an n-bit binary string and then define each run of ones as an element in an equivalence relation.at n=11A247100
- Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to SmallGroup(729,95).at n=6A250239
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 670", based on the 5-celled von Neumann neighborhood.at n=32A273394
- Numbers k such that (10^k - 79)/3 is prime.at n=17A293853
- Number of (undirected) paths in the n-book graph.at n=15A307921
- Number of equal-length matchings of 2n uniformly spaced points on a circle.at n=27A381194