9496
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17820
- Proper Divisor Sum (Aliquot Sum)
- 8324
- 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
- 4744
- Möbius Function
- 0
- Radical
- 2374
- Omega Function (Ω)
- 4
- 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
- 78
- 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
- Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.at n=10A000085
- a(n) = a(n-1) + a(n-5); a(0) = ... = a(4) = 1.at n=35A003520
- Table T(n,k) giving number of permutations of [1..n] with order dividing k, read by antidiagonals.at n=56A008307
- Expansion of 1/(1 -x^5 -x^6 -x^7 - ...).at n=40A017899
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=23A020425
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 23.at n=42A031521
- Number of days in n years (n=4 is the first leap year).at n=25A033171
- Number of days in n years (n=3 is the first leap year).at n=25A033172
- T(n+5,5) with T as in A036355.at n=6A036684
- Partial sums of rows of A047884. Young Tableaux by height.at n=54A049400
- Difference between average of smallest prime greater than n^3 and largest prime less than (n+1)^3 and n-th pronic [=n(n+1)].at n=19A063036
- Bisection of A000085.at n=5A066223
- Triangle read by rows where T(n+1,k)=T(n,k)+n*T(n-1,k) starting with T(n,n)=1 and T(n,k)=0 if n<k.at n=55A070895
- Number of right triangles whose vertices are lattice points in {1,2,...,n} X {1,2,...,n}.at n=8A077435
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2,3}.at n=37A079955
- Euler-Seidel matrix T(k,n) with start sequence A001147, read by antidiagonals.at n=55A099020
- Triangle T(n, k) = binomial(n, k) * A000085(n-k), 0 <= k <= n.at n=55A111062
- 4-almost primes with semiprime digits (digits 4, 6, 9 only).at n=16A111496
- Triangle T(n,k) read by rows: number of k X k symmetric (0,1)-matrices with exactly n entries equal to 1 and no zero rows or columns.at n=65A135589
- Triangle T(n,k) read by rows: number of k X k symmetric matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n.at n=54A138177