5888
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 12264
- Proper Divisor Sum (Aliquot Sum)
- 6376
- 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
- 2816
- Möbius Function
- 0
- Radical
- 46
- Omega Function (Ω)
- 9
- Little Omega Function (ω)
- 2
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
- 23
- 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
- Generalized tangent numbers d_(n,2).at n=11A000176
- Numerators of Cotesian numbers (not in lowest terms): A002176*C(n,1).at n=7A002178
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=43A002569
- Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600.at n=29A006416
- Number of labeled odd degree trees with 2n nodes.at n=3A007106
- Exponential-convolution of natural numbers with themselves.at n=8A007466
- Les Marvin sequence: a(n) = F(n) + (n-1)*F(n-1), F() = Fibonacci numbers.at n=14A007502
- Molien series for A_10.at n=33A008633
- Number of partitions of n into at most 10 parts.at n=33A008639
- a(n) = (2*n - 9)*n^2.at n=16A015243
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite ATT = AlPO4-12-TAMU [Al12P12O48].4R starting with a T2 atom.at n=5A018988
- Fibonacci sequence beginning 1, 15.at n=14A022105
- Number of partitions of n into 10 unordered relatively prime parts.at n=33A023030
- Numbers that are the sum of 4 nonzero squares in exactly 3 ways.at n=49A025359
- Number of partitions of n in which the least part is odd.at n=30A026804
- Number of partitions of n in which the greatest part is 10.at n=43A026816
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 21 (most significant digit on left).at n=9A029490
- Numbers k such that 225*2^k+1 is prime.at n=34A032489
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)).at n=49A036817
- Numerators of continued fraction convergents to sqrt(77).at n=6A041136