9392
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 18228
- Proper Divisor Sum (Aliquot Sum)
- 8836
- 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
- 4688
- Möbius Function
- 0
- Radical
- 1174
- Omega Function (Ω)
- 5
- 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
- 122
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 whose base-5 representation contains exactly three 0's and two 3's.at n=27A045201
- Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients.at n=32A059720
- a(0)=0; a(1)=1; a(2)=2; a(n)= a(n-1) + a(n-2)*a(n-3).at n=10A063402
- Let r, s, t, u be four permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i)*u(i).at n=11A070736
- Sum of generalized tribonacci numbers (A001644) and reflected generalized tribonacci numbers (A073145).at n=15A075092
- Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.at n=27A078184
- Least K such that K*p(n)#-1 is the first of twin primes and 2*(K*p(n)#-1)+1 is prime, so K*p(n)#-1 is the first of twin primes and a Sophie Germain prime.at n=33A117848
- Number of square permutations of length n.at n=7A128652
- Partial sums of A004207.at n=47A176718
- Partial sums of "Half-Catalan numbers" A000992.at n=14A178833
- Number of nondecreasing arrangements of n numbers in -3..3 with sum zero and sum of squares not greater than n*12/3.at n=24A183921
- Triangle of coefficients of polynomials v(n,x) jointly generated with A208932; see the Formula section.at n=41A208932
- Number of length n+3 0..3 arrays with no disjoint pairs in any consecutive four terms having the same sum.at n=4A247721
- T(n,k)=Number of length n+3 0..k arrays with no disjoint pairs in any consecutive four terms having the same sum.at n=25A247726
- Number of length 5+3 0..n arrays with no disjoint pairs in any consecutive four terms having the same sum.at n=2A247731
- Numbers equal to the arithmetic derivative of their Euler totient function.at n=31A248815
- Expansion of Product_{k>=0} 1/(1 - x^(3*k+1))^2.at n=37A261616
- Expansion of Product_{k>=1} (1 - x^(18*k)) * (1 - x^(18*k-9)) * (1 + x^k) / (1 - x^k).at n=21A280947
- Numbers k for which k' = x'*y', where k = x + y with x and y composite, and k', x', y' are the arithmetic derivatives of k, x, y.at n=42A370126