9686
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 5434
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4648
- Möbius Function
- -1
- Radical
- 9686
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 166
- 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
- Balancing weights on the integer line.at n=9A002838
- a(n) = n*(23*n + 1)/2.at n=29A022281
- Least sum of 3 distinct nonzero squares in exactly n ways.at n=41A025415
- Triangle of numbers a(n,k) = number of balance positions when k equal weights are placed at a k-subset of the points {-n, -(n-1), ..., n-1, n} on a centrally pivoted rod.at n=54A047997
- Number of partitions of the n-th triangular number involving only the numbers 1..n and with exactly n terms.at n=11A076822
- Numbers that are not the sum of two triangular numbers and a fourth power.at n=43A115160
- Triangle, read by rows, where T(n,k) is the coefficient of q^((n+1)*k) in the q-binomial coefficient [2*n+1, n] for n >= k >= 0.at n=60A128562
- a(n) = A000043(n) - 3.at n=19A139480
- Number of weighted lattice paths in L_n having no (1,0)-steps at level 0. The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=14A182894
- Number of nondecreasing arrangements of n numbers in -5..5 with sum zero.at n=10A183913
- Number of 3-element nondividing subsets of {1, 2, ..., n}.at n=41A187490
- T(n,k) is the number of strictly increasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero.at n=64A188181
- T(n,k) is the number of strictly increasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero.at n=65A188181
- Number of isomorphism classes of nanocones with 5 pentagons and a symmetric boundary of length n.at n=12A198086
- T(n,k)=Number of nondecreasing arrays of n 0..n-1 integers with the sum of their k'th powers equal to sum(i^k,i=0..n-1).at n=65A216635
- T(n,k)=Number of nondecreasing arrays of n 1..n integers with the sum of their k powers equal to sum(i^k,i=1..n).at n=65A216645
- Numbers of the form 5^j + 9^k, for j and k >= 0.at n=29A226829
- Numbers n such that A234519(n) = n.at n=43A234524
- Bernoulli number B_{n} has denominator 354.at n=24A255684
- The largest coefficients of the extended q-Catalan polynomials which are defined in A274886.at n=21A275213