5898
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11808
- Proper Divisor Sum (Aliquot Sum)
- 5910
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1964
- Möbius Function
- -1
- Radical
- 5898
- 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
- yes
- Odd
- no
Appears in sequences
- Number of symmetrical planar partitions of n (planar partitions (A000219) that when regarded as 3-D objects have just one symmetry plane).at n=31A000784
- Array (a frieze pattern) defined by a(n,k) = (a(n-1,k)*a(n-1,k+1) - 1) / a(n-2,k+1), read by antidiagonals.at n=41A007754
- Poincaré series [or Poincare series] for depths of roots in a certain root system.at n=22A019527
- Expansion of 1/((1-x)*(1-5*x)*(1-8*x)*(1-11*x)).at n=3A022628
- Number of partitions of n into 6 unordered relatively prime parts.at n=45A023026
- Convolution of odd numbers and A000201.at n=21A023658
- Shifts left under "BIJ" (reversible, indistinct, labeled) transform.at n=5A032117
- Related to enumeration of edge-rooted catafusenes.at n=14A039658
- Row 5 of A007754.at n=3A058796
- Numbers which are the sum of their proper divisors containing the digit 9.at n=19A059468
- Triangular array related to tennis ball problem, read by rows.at n=38A079521
- a(n) is the minimal area of a convex lattice polygon with 2n sides.at n=33A089187
- Expansion of q * (chi(-q) * chi(-q^5))^-4 in powers of q where chi() is a Ramanujan theta function.at n=12A093831
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k peaks at odd height.at n=43A097891
- a(n) = number of distinct values of Product_{i=1..r} x_i!*i!^x_i, where (x_1, ..., x_r) is an r-tuple of nonnegative integers with Sum_{i=1..r} i*x_i = n.at n=39A102465
- a(n) = numerator of b(n): b(n) = the maximum possible value for a continued fraction whose terms are a permutation of the terms of the simple continued fraction for H(n) = sum{k=1 to n} 1/k, the n-th harmonic number.at n=8A129082
- a(n) = 3*n^2 - 4*n + 3.at n=44A141631
- Triangle read by rows: a(1,1) = 1. a(m,m) = sum of all terms in rows 1 through m-1. a(m,n) = a(m-1,n) + (sum of all terms in rows 1 through m-1), for n < m.at n=27A159927
- Numbers k such that k^3 +-5 are primes.at n=25A176684
- a(n) = 6*(24*n - 1).at n=40A187206