9742
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14616
- Proper Divisor Sum (Aliquot Sum)
- 4874
- 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
- 4870
- Möbius Function
- 1
- Radical
- 9742
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 47
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 98.at n=7A031596
- Number of primitive (period n) step cyclic shifted sequence structures using a maximum of two different symbols.at n=21A056439
- Number of primitive (period n) step cyclic shifted sequence structures using exactly two different symbols.at n=21A056444
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=16A065903
- Let T = Sum_{k >= 1} k^(k-1)*x^k be the g.f. for rooted labeled trees (A000169); sequence has g.f. T/(1-T).at n=5A088342
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant, from (0,0) to (n,0), consisting of steps U=[1,1], D[1,-1], h=(1,0) and H=(2,0), having height k (0<=k<=floor(n/2)).at n=38A132888
- Number of partitions of n having no parts with multiplicity 9.at n=33A184644
- Number of permutations of 1..n with displacements restricted to {-6,-5,-4,-3,-1,0,2}.at n=13A189594
- G.f. satisfies: A(x) = 1/(1-x) - 1/(1-x*A(x)) + 1/(1-x*A(x)^2).at n=8A196018
- A002110(n)-(p[i]+p[i+1]+...+p[i+n-1]), where p[i] is the largest prime such that this is nonnegative.at n=55A196129
- Solution of the complementary equation a(n) = a(n-2) + b(0) + b(1) + ... + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=44A295055
- Number of rooted twice-partitions of n where the composite rooted partition is strict.at n=26A301750
- Sum of the even parts in the partitions of n into 10 parts.at n=31A309664
- Number of labeled totally ordered monoids with n elements.at n=6A346413
- Number of integer partitions of n into parts > 1 whose product is a multiple of n.at n=49A379734