5763
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8208
- Proper Divisor Sum (Aliquot Sum)
- 2445
- 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
- 3584
- Möbius Function
- -1
- Radical
- 5763
- 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
- 36
- 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
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=23A000070
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=39A003402
- n written in fractional base 8/5.at n=51A024647
- Number of palindromic partitions of n.at n=46A025065
- Number of palindromic partitions of n.at n=47A025065
- 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 75.at n=13A031573
- Lucky numbers that are decimal concatenations of n with n + 6.at n=7A032656
- Number of partitions with at most one part divisible by 5.at n=30A039905
- Numerators of continued fraction convergents to sqrt(135).at n=9A041246
- Numerators of continued fraction convergents to sqrt(540).at n=5A042032
- Integers n > 879 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 879.at n=28A063052
- Number of length 3 walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part.at n=17A064043
- Denominator of coefficient G_n defined by Sum_{ (m,m') != (0,0)} 1/(m+m'*sqrt(-2))^(2*n) = (4*w)^(2*n)*G_n/(2*n)!, where 2w is one of the periods of the associated Weierstrass P-function.at n=55A069239
- Number of Motzkin paths of length n with no level steps at odd level.at n=13A090344
- Number of partitions of n with at most one odd part.at n=47A100824
- Number of partitions of n with at most 2 odd parts.at n=47A100835
- Least multiple of n such that every partial concatenation followed by a 9 is prime.at n=50A105185
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 6 multiples of n-1, n-2, ..., 1.at n=45A113743
- Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k UH's, where U=(1,1), H=(1,0) (0<=k<=floor(n/3)).at n=35A114576
- a(n) = 3*n^2 - n - 1.at n=43A144390