9373
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11648
- Proper Divisor Sum (Aliquot Sum)
- 2275
- 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
- 7344
- Möbius Function
- -1
- Radical
- 9373
- 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
- 153
- 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
- Molien series for A_11.at n=35A008634
- Number of partitions of n into at most 11 parts.at n=35A008640
- Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year.at n=41A014088
- Number of subsets of { 1, ..., n } containing an A.P. of length 6.at n=16A018791
- Pseudoprimes to base 57.at n=44A020185
- Least k>1 such that first n terms of Kolakoski sequence A000002 repeat in reverse order beginning at k-th term.at n=49A022295
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).at n=16A023487
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number).at n=17A023493
- a(n) = (n+1)*(n+2)*(n+3)*(9n+4)/24.at n=11A051798
- McKay-Thompson series of class 21D for Monster.at n=22A058566
- When expressed in base 3 and then interpreted in base 4, is a multiple of the original number.at n=15A062853
- Sum of the remainders when n^2 is divided by squares less than n.at n=41A067459
- Numbers k for which the sums of prime factors (ignoring multiplicity) of sigma(k) and phi(k) are equal but the sets of prime factors of sigma and phi are different.at n=36A081378
- Number of chess diagrams that can be obtained in exactly one way in n plies. This is also the number of dual-free proof games in n plies.at n=4A090051
- Number of partitions of 2n free of multiples of 8 such that 4 occurs at most once. All odd parts occur with even multiplicities. There is no restriction on the other even parts.at n=24A100684
- Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 2 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=28A112560
- a(n+1) -+ a(n) = prime, a(n+1)*a(n) = average of twin prime pairs, a(1)=1, a(2)=6.at n=30A154494
- Products of three distinct happy primes A035497.at n=11A154717
- Products of three distinct primes of the form 6*k + 1.at n=18A154729
- Products of 3 distinct non-Sophie Germain primes.at n=38A157347