9860
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 12820
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3584
- Möbius Function
- 0
- Radical
- 4930
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 73
- 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
- Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. Sequence gives S(n-3,n).at n=6A010849
- Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x.at n=51A011117
- Number of segments created by diagonals of n-gon.at n=17A014629
- a(n) = position of n^3 + 9 in A003072.at n=44A024971
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)).at n=49A036812
- Denominators of continued fraction convergents to sqrt(291).at n=3A041547
- Records in A069862.at n=12A088343
- Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having a k-gon over a fixed edge (base).at n=38A091370
- Triangle read by rows: T(n,k) is number of Schroeder paths of length 2n and having k peaks at height 1, for 0 <= k <= n.at n=48A104219
- Least K such that K*(3^(n+j))+1 is prime for j=0 to 4.at n=5A109854
- Positions of high-water marks of A118421.at n=46A118423
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=35A119864
- a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.at n=17A124350
- 4 times octagonal numbers: a(n) = 4*n*(3*n-2).at n=29A153794
- Sums of the antidiagonals of Sundaram's sieve (A159919).at n=28A159920
- Number of binary strings of length n with equal numbers of 001 and 011 substrings.at n=15A164142
- Nonnegative integers m such that m^2 = (a^2-1)*(b^2+1) for some integers a,b.at n=38A174134
- Partial sums of A049486.at n=24A174655
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+2737)^2 = y^2.at n=30A201916
- Number of simple labeled graphs on n+2 nodes with exactly n connected components that are trees or cycles.at n=15A215862