9782
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15096
- Proper Divisor Sum (Aliquot Sum)
- 5314
- 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
- 4752
- Möbius Function
- -1
- Radical
- 9782
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 179
- 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
- If a, b in sequence, so is ab+10.at n=39A009368
- Number of trees on n nodes with forbidden limbs.at n=10A014272
- a(n+1) = floor( (a(n) + 1)^(1 + 1/n) ), with a(1) = 1.at n=10A080869
- Consider trajectory of n under repeated applications of the function f(x) = 'Sum of the prime factors of x (with multiplicity)' (see A029908). Sequence gives composite numbers n that end at a prime m that divides n and m is greater than any m's seen already.at n=7A084931
- Sum of the numbers of unitary divisors of the binomial coefficients C(n,k), k=0..n.at n=41A103445
- Numbers x such that (x+67)^3-x^3 is a square.at n=0A145209
- Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 9).at n=34A212368
- prime(n^2) - prime(n).at n=34A213926
- Number of partitions of prime(n) into distinct parts not larger than prime(n-1).at n=15A318604
- Squarefree numbers k such that the sum of the distinct prime factors of k is twice the difference between the largest and the smallest prime factors of k.at n=14A324210
- Starts of runs of 3 consecutive numbers with the same total binary weight of their divisors (A093653).at n=9A338453
- a(n) is the previous term in binary with 0's and 1's put alternatingly before each digit, starting with 0.at n=4A348162
- Number of integer partitions of n with a repeated part other than the least.at n=34A375405