9786
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 12678
- 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
- 2784
- Möbius Function
- 1
- Radical
- 9786
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 135
- 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) = n*(25*n - 1)/2.at n=28A022282
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=43A052049
- Triangle T(n,k) read by rows, where o.g.f. for T(n,k) is n!*Sum_{k=0..n} (1+x)^(n-k)/k!.at n=22A073474
- Least k such that k*prime(k) > 10^n.at n=9A090977
- a(0)=1; a(n) = sigma_1(n) + sigma_2(n) + sigma_3(n).at n=20A092347
- a(n) = Sum_{k=1..n} k*k!*C(n,k).at n=6A093964
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=40A113537
- Inverse binomial transform of lucky numbers (A000959).at n=14A123593
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} in which the last entry of the first increasing run is equal to k (1 <= k <= n).at n=34A134433
- Numbers k such that k and k^2 use only the digits 5, 6, 7, 8 and 9.at n=6A137147
- Numbers k with squares that are concatenations k^2 = x//y such that x is an anagram of y.at n=5A162945
- Numbers n such that n^2 contains no digit less than 5.at n=45A175471
- Joint-rank array of numbers j*r^(i-1), where r=1+sqrt(3), read by antidiagonals.at n=53A182832
- Number of 7-element nondividing subsets of {1, 2, ..., n}.at n=32A187494
- Number A(n,k) of paths starting at {n}^k to a border position where one component equals 0 using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=38A210472
- Number of 2 X 2 matrices M with terms in {1,...,n} such that permanent(M) > n.at n=10A212241
- Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=41A249248
- Number of (n+1) X (2+1) 0..2 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=5A251131
- Number of (n+1) X (6+1) 0..2 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=1A251135
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.at n=22A251137