5766
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 11916
- Proper Divisor Sum (Aliquot Sum)
- 6150
- 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
- 1860
- Möbius Function
- 0
- Radical
- 186
- Omega Function (Ω)
- 4
- 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
- 142
- 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
- a(n) = prime(n)*prime(n-1) - 1.at n=21A023515
- Number of 7's in all partitions of n.at n=35A024791
- a(n) = 6*n^2.at n=31A033581
- Normalized extreme values for "3x+1" trees of depth n.at n=12A045474
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives i values.at n=31A053719
- Number of residue classes modulo n-th primorial number which contain a prime.at n=6A057857
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^5 *product_{i=1..t} (1-x^i) ).at n=13A059822
- G.f.: V(x)^(1/4), where V(x) = Sum_{n >= 0} A065409(n)*x^n.at n=4A060042
- usigma(n) = 2n + d(n), where d(n) is the number of divisors of n.at n=9A063829
- Reflective numbers: k such that the decimal encoding of the prime factorization of k (A067599) is palindromic.at n=36A066985
- Records for the number of integers k such that k is not of the form m + reverse(m) for any m and for some n A067030(n) occurs in the 'Reverse and Add' trajectory of k (cf. A067284).at n=47A067288
- Number of divisors of n equals the average of distinct prime factors of n.at n=25A067547
- Numbers k such that sigma(core(k)) = tau(k) where core(k) is the squarefree part of k, tau(k) is the number of divisors of k, and sigma(k) is their sum.at n=37A069827
- Numbers n such that the digital binary sum of n equals core(n), the squarefree part of n.at n=28A077476
- Solution to the Dancing School Problem with 4 girls and n+4 boys: f(4,n).at n=9A079909
- Solution to the Dancing School Problem with n girls and n+9 boys: f(n,9).at n=3A079928
- a(n) = (p-1)! mod p^2 where p = n-th prime.at n=21A112660
- Numbers k such that the k-th triangular number contains only digits {1,2,6}.at n=11A119104
- Smallest area of any triangle with integer sides a <= b <= c and inradius n.at n=30A120572
- Analog of A060410 for the 5x+1 problem (cf. A133419).at n=10A133424