9370
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16884
- Proper Divisor Sum (Aliquot Sum)
- 7514
- 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
- 3744
- Möbius Function
- -1
- Radical
- 9370
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- E-trees with exactly 3 colors.at n=6A007144
- Numbers k such that the continued fraction for sqrt(k) has period 43.at n=23A020382
- a(n) = L(n+2) + c(n) where L(k) is the k-th Lucas number and c(n) is the n-th number that is 1 or 3 or is not a Lucas number.at n=16A022810
- Numbers whose set of base-8 digits is {2,3}.at n=32A032808
- Sets of 4 consecutive numbers with equal number of divisors.at n=31A039665
- Numbers having four 2's in base 8.at n=15A043432
- Rounded volume of a regular tetrahedron with edge length n.at n=43A071399
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k DHH...HU's, where U=(1,1), D=(1,-1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=28A098083
- a(n) = 4*n^2 + 28*n + 10.at n=44A153644
- a(0) = -1, otherwise a(n) = (-1)^n*(n^3 - 15*n^2 + 2*n - 12)/6.at n=44A173248
- Iterates of f(x)=floor((3x-1)/2) from x=6.at n=19A183208
- Numbers k such that the period of Fibonacci numbers mod k is 3*(k+10).at n=42A229466
- Number of partitions p of n such that median(p) <= multiplicity(min(p)).at n=35A240213
- Number of partitions p of n such that (number of numbers in p of form 3k+2) > (number of numbers in p of form 3k).at n=37A241742
- Triangle read by rows: T(n,m) = Sum_{k=0..n} C(k-1,m-1)*C(k,m-1)*C(n+k-1,n-k)/m.at n=31A257142
- Triangle read by rows: Take a pentagon with all diagonals drawn, as in A331929. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+5.at n=30A331939
- Number of ways to write n as an ordered sum of 10 nonprime numbers.at n=19A341504
- a(n) is the result of n applications of the function f on n, where f(x) = floor((3*x - 1)/2) (A001651).at n=16A353215
- Unitary noncototient numbers: numbers k such that A323410(x) = k has no solution.at n=43A362182
- Number T(n,k) of partitions of n with largest part k where each block of part i with multiplicity j is marked with a word of length i*j over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur exactly once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=58A364285