9906
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21504
- Proper Divisor Sum (Aliquot Sum)
- 11598
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 1
- Radical
- 9906
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- Conjectured number of irreducible multiple zeta values of depth n and weight 3n (confirmed up to n=7).at n=39A020999
- a(n) = n*(13*n + 1)/2.at n=39A022271
- Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, under action of dihedral group of the square D_4.at n=11A054343
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,5.at n=18A064239
- Treated as strings, n begins with Floor(sqrt(n)).at n=29A069086
- Prime(a(n)) + ... + prime(a(n)+3) is a square = A051395(n)^2.at n=19A072849
- Consider iteration of the function f(x) = sigma(phi(x)) = A062402(x). Sequence lists the numbers k such that the trajectory of k returns to k.at n=29A096998
- 6 times heptagonal numbers: a(n) = 3*n*(5*n-3).at n=26A153786
- a(1) = 1; a(2*n) = prime(n)*a(n), a(2*n+1) = prime(n)*a(n) + a(n+1), where prime(n) is the n-th prime.at n=24A176716
- Number of unbreakable loops of order n.at n=2A180423
- G.f.: q-sinh(x) evaluated at q=-x.at n=35A198202
- a(n) = 8*n^2 + 3*n + 1.at n=35A236267
- Sum of divisors of the minimal numbers (A007416).at n=27A256259
- Squarefree numbers that are k*A005117(k) for some k.at n=37A257832
- Numbers k such that (5*10^k - 101)/3 is prime.at n=17A282506
- Number of binary words w of length n such that the number of distinct blocks of length k that w contains is <= k+2 for all k.at n=25A297526
- Number of prime parts in the partitions of n into 10 parts.at n=37A309439
- Number of equivalence classes of binary words of length n for the subword 10110.at n=30A317669
- a(n) = Sum_{k=1..n} (k/gcd(n, k))^2.at n=39A332654
- Number of ways to write n as an ordered sum of 6 primes (counting 1 as a prime).at n=31A341985