9926
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17040
- Proper Divisor Sum (Aliquot Sum)
- 7114
- 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
- 4248
- Möbius Function
- -1
- Radical
- 9926
- 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
- 42
- 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
- Number of partitions of 3n into n parts from the set {0, 1, ..., 6} (repetitions admissible).at n=23A001977
- Poincaré series (or Poincare series) of Lie algebra associated with a certain braid group.at n=6A007994
- Expansion of 1/((1-4x)(1-7x)(1-9x)(1-11x)).at n=3A028150
- Interprimes which are of the form s*prime, s=14.at n=17A075289
- Numbers n such that 3*10^n + 8*R_n + 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=17A102980
- Group the triangular numbers so that the n-th group sum is a multiple of n. 1, (3, 6, 10, 15), (21), (28), (36, 45, 55, 66, 78), (91, 105, 120, 136, 153, 171, 190), ... Sequence contains n-th group sum divided by n.at n=30A114032
- Number of partitions of n into parts relatively prime to 63 and not == 2 (mod 4).at n=51A119952
- Ulam's spiral (NNE spoke).at n=25A143861
- Let c(n) = x^(2^n-1)*(1-x^(2^n)), g(n) = 1 + x^(2^n-1) + x^(2^n), h(n) = Product_{i=1..n} g(i); then use g.f. Sum_{n>=1} c(n)/h(n).at n=65A151676
- Number of strictly increasing arrangements of 6 numbers in -(n+4)..(n+4) with sum zero.at n=9A188184
- Numbers n such that d(n-1) = d(n+1) = 6, where d(k) is the number of divisors of k (A000005).at n=35A190267
- Sum of positive Dyson's ranks of all partitions of n.at n=27A209616
- Numbers k such that 3^k - 10 is prime.at n=24A217347
- Unchanging value maps: number of nX6 binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 nX6 array.at n=2A219419
- T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 nXk array.at n=30A219421
- Unchanging value maps: number of 3 X n binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 3 X n array.at n=5A219423
- Number of non-equivalent ways to choose 4 points in an equilateral triangle grid of side n.at n=7A231653
- Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.at n=46A239567
- Number of ways to place 3 points on a triangular grid of side n so that no two of them are adjacent.at n=7A239569
- Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k UHU configurations, where U=(0,1), H(1,0); (n>=2, k>=0).at n=45A273896