9614
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 7666
- 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
- 3960
- Möbius Function
- 1
- Radical
- 9614
- Omega Function (Ω)
- 4
- 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
- 122
- 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
- a(n) = 2*(3*n)! / ((2*n+1)!*(n+1)!).at n=8A000139
- Numbers k such that 169*2^k+1 is prime.at n=18A032461
- a() = 1,3,... [ A037257 ], differences = 2,... [ A037258 ] and 2nd differences [ A037259 ] are disjoint and monotonic; adjoin next free number to 2nd differences unless it would produce a duplicate in which case ignore.at n=33A037257
- Sum of first n primes of form 4k-1.at n=45A038347
- a(n+1) = a(n)+greatest prime divisor of a(n-1).at n=44A078695
- Sum of multinomials of (-1 + number of runs) in the partitions of n.at n=20A080528
- Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.at n=35A093346
- Triangle read by rows: T(n,k) is the number of permutations p of [n] such that the length of the longest 2-stack sortable initial segment of p is equal to k.at n=35A094785
- a(n) = n^6 - 11n^4 + 36n^2 - 36.at n=5A109256
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, -1), (1, 0, -1), (1, 0, 0)}.at n=10A148179
- a(n) = n*(n+1)*(5*n + 4)/6.at n=22A162147
- a(n) = 19*n*(n+1).at n=22A173309
- Square array read by upwards antidiagonals: T(m,n) is the number of simple 3-connected triangulations of a closed region in the plane with m+3 given external edges and 3n+m internal edges, m>=0, n>=1.at n=43A210664
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array.at n=22A219680
- Number of length n+2 0..2 arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=6A251929
- T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=34A251935
- Number of length 7+2 0..n arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=1A251941
- Numbers that are representable in at least two ways as sums of four distinct nonvanishing cubes.at n=2A259060
- Number of non-equivalent ways to place 3 non-attacking ferses on an n X n board.at n=8A278682
- Expansion of Product_{k>=1} 1/((1 - x^k)*(1 - x^(5*k))).at n=30A318028