9301
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9504
- Proper Divisor Sum (Aliquot Sum)
- 203
- 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
- 9100
- Möbius Function
- 1
- Radical
- 9301
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 122
- 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
- no
- Odd
- yes
Appears in sequences
- Pseudoprimes to base 70.at n=34A020198
- Strong pseudoprimes to base 70.at n=10A020296
- [ (4th elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+3 odd positive integers}.at n=16A024205
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=31A024848
- Centered 20-gonal (or icosagonal) numbers.at n=30A069133
- a(n) = S(n)*S(n-1), where S(n) are the generalized tribonacci numbers A001644.at n=8A073748
- Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).at n=24A074814
- The first 10 digits of the fifth root of n contain the digits 0-9.at n=6A119520
- Number of nonempty subsets of {1, 2, ..., n} with <= 4 pairwise coprime elements.at n=34A187265
- Number of (n+1)X(1+1) 0..2 arrays x(i,j) with row sums sum{j*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=5A233046
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=20A233049
- Indices of centered heptagonal numbers (A069099) which are also centered pentagonal numbers (A005891).at n=4A253621
- Integers m such that ceiling(sqrt(m!)) is prime.at n=8A273932
- Numbers k such that (19*10^k + 77) / 3 is prime.at n=22A276353
- Expansion of Product_{k>=1} (1 + x^(2*k)) / (1 - x^k).at n=26A279328
- Numbers k such that (86*10^k + 121)/9 is prime.at n=22A283185
- Smith numbers (A006753) for which the arithmetic derivative (A003415) is also a Smith number.at n=42A357841
- a(n) = sum of the first n primes whose distance to next prime is 4.at n=30A360226
- a(n) = Sum_{k=1..n} binomial(n, k) (mod 2^k).at n=17A386660