5895
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10296
- Proper Divisor Sum (Aliquot Sum)
- 4401
- 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
- 3120
- Möbius Function
- 0
- Radical
- 1965
- 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
- 80
- 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
- no
- Odd
- yes
Appears in sequences
- "Pascal sweep" for k=8: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=43A009522
- Pisot sequence T(3,5).at n=19A020745
- Pisot sequence T(5,8), a(n) = floor(a(n-1)^2/a(n-2)).at n=18A020749
- [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 1 mod 4}.at n=8A024386
- For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.at n=42A027442
- Number of bracelets (turnover necklaces) with n beads of 5 colors.at n=6A032276
- Numbers k such that 129*2^k+1 is prime.at n=16A032414
- Numbers whose set of base-14 digits is {1,2}.at n=26A032934
- Every run of digits of n in base 14 has length 2.at n=27A033012
- Positive integers having more base-14 runs of even length than odd.at n=28A044840
- Odd numbers with exactly 4 palindromic prime factors (counted with multiplicity).at n=37A046374
- Number of ways to color vertices of a heptagon using <= n colors, allowing rotations and reflections.at n=5A060532
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2*(1-x^3)^2*(1-x^8)*(1-x^9)*(1-x^10)).at n=20A069956
- Expansion of 1/((1-x)*(1-x-x^3)).at n=21A077868
- Triangle T(b,k) read by rows, giving numbers of pairs of unequal permutations of all the digits 1, ..., k in base b (k<b) whose ratio is an integer.at n=44A080202
- Steffi sequence; the numbers of pairs of unequal permutations of all the digits 1, ..., b-1 in base b whose ratio is an integer.at n=9A080203
- Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n).at n=25A081720
- Diagonal of A083167.at n=45A083168
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=14A083752
- Numbers n such that A003313(n) = A003313(2n).at n=17A086878