6477
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9216
- Proper Divisor Sum (Aliquot Sum)
- 2739
- 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
- 4032
- Möbius Function
- -1
- Radical
- 6477
- 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
- 49
- 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
- no
- Odd
- yes
Appears in sequences
- q-Catalan numbers (binomial version) for q=2.at n=4A015030
- Fibonacci sequence beginning 1, 10.at n=15A022100
- Number of terms in 5th derivative of a function composed with itself n times.at n=16A022815
- Poincaré (or Molien) series for ring of Siegel modular forms of genus 3 (associated with full modular group Gamma_3).at n=42A027634
- Distinct odd elements in 4-Pascal triangle A028275 (by row).at n=31A028281
- Odd elements (greater than 1) to right of central elements in 4-Pascal triangle A028275.at n=30A028287
- Number of partitions of n into parts not of the form 23k, 23k+8 or 23k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=31A035996
- Add column entries of the table with rows (1,2,0,0...), (0,3,4,5,0,0...), (0,0,6,7,8,9,0,0...), (0,0,0,10,11,12,13,14,0,0...), ...at n=33A064694
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=9A066509
- Numbers k such that sigma(sigma(k)-k) = phi(k).at n=7A074875
- Number of partitions of n into at least two parts such that the product of largest and smallest part does not exceed n.at n=31A116901
- Odd interprimes divisible by 17.at n=21A124620
- a(n) = A135951(n) /[(2^(n+1)-1) * 2^(n*(n-1)/2)].at n=4A136097
- a(n) is the sum of all possible pairs of the first n primes.at n=15A162867
- A sequence of triples of squarefree consecutive integers each composed of exactly three primes.at n=27A165936
- a(n) = Sum_{k<=n} A000203(k)*(n-k+1), where A000203(m) is the sum of divisors of m.at n=27A175254
- Riordan matrix ( (1-2x)/(1-2x-x^2), (x-2x^2)/(1-2x-x^2) ).at n=80A188285
- a(n) = Sum{0<=k<=n} binomial(n+k, n-k) * k! / (floor(k/2)! * floor((k+2)/2)!).at n=8A190908
- Square excess of Fibonacci numbers.at n=44A190993
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+287)^2 = y^2.at n=19A205644