5883
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
- 8
- Divisor Sum
- 8208
- Proper Divisor Sum (Aliquot Sum)
- 2325
- 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
- 3744
- Möbius Function
- -1
- Radical
- 5883
- 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
- 142
- 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
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=35A000338
- Convolution of natural numbers with Beatty sequence for tau^2 A001950.at n=22A023542
- Lucky numbers with size of gaps equal to 14 (upper terms).at n=28A031897
- Floor( 7*n^2/2 ).at n=41A032525
- Multiplicity of highest weight (or singular) vectors associated with character chi_133 of Monster module.at n=37A034521
- Numerators of continued fraction convergents to sqrt(524).at n=7A042002
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1.at n=4A096025
- Index of the smallest prime greater than (6n+1)^2.at n=40A174321
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 2,1,1,0,1,0,0 for x=0,1,2,3,4,5,6.at n=4A197853
- Number of compositions of n such that the number of parts is not divisible by the greatest part.at n=13A199884
- For any number n take the polynomial formed by the product of the terms (x-pi), where pi's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is a positive integer.at n=36A203612
- Number of nonnegative integer arrays of length n+2*6-2 with new values introduced in order 0 upwards and every value appearing only in runs of at least 6.at n=25A211698
- Number of n X n 0..2 arrays with rows, antidiagonals and columns unimodal.at n=2A223717
- Number of n X 3 0..2 arrays with rows, antidiagonals and columns unimodal.at n=2A223720
- T(n,k)=Number of nXk 0..2 arrays with rows, antidiagonals and columns unimodal.at n=12A223725
- Composite squarefree numbers n such that p(i)+3 divides n-3, where p(i) are the prime factors of n.at n=5A225713
- Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i*j*k| <= n and gcd(i,j,k) <= 1.at n=24A226357
- Start of a triple of consecutive squarefree numbers each of which has exactly 3 distinct prime factors.at n=25A242606
- a(n) = smallest positive multiple of n whose factorial base representation contains only 0's and 1's.at n=36A286820
- Triangle T(n,k) read by rows: the number of semigroups of orientation-preserving partial transformations on n element with right waist k.at n=26A289714