6088
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11430
- Proper Divisor Sum (Aliquot Sum)
- 5342
- 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
- 3040
- Möbius Function
- 0
- Radical
- 1522
- Omega Function (Ω)
- 4
- 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
- 36
- 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
- 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 39.at n=17A031537
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 39.at n=1A031717
- Numerators of continued fraction convergents to sqrt(155).at n=4A041284
- Composite n such that phi(n+4) = phi(n)+4.at n=40A056773
- Diagonally symmetric (about diagonal 2) 2n-celled polyominoes with 1 hole.at n=13A057424
- Numbers k such that k divides prime(k^2)+1.at n=17A067853
- a(0)=1, a(n) is the smallest integer >= a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals the number of elements in this continued fraction.at n=44A070900
- Sum of odd-indexed primes.at n=36A077131
- Expansion of q * chi(-q) / chi(-q^5)^5 in powers of q where chi() is a Ramanujan theta function.at n=55A095813
- Non-cubefree numbers k such that 2k+1 is also non-cubefree (A046099).at n=41A115170
- a(n) = 9 + floor((3 + Sum_{j=1..n-1} a(j))/4).at n=29A120167
- Number of P_4-sparse perfect graphs on n nodes.at n=9A123441
- O.g.f.: Sum_{n>=0} n!*(x/(1+x)^2)^n.at n=8A127548
- Number of facets of the Alternating Sign Matrix polytope ASM(n).at n=41A128445
- a(n) is the number of n-tosses having a run of 6 or more heads for a fair coin (i.e., probability is a(n)/2^n).at n=16A143662
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (1, 0, -1), (1, 1, 1)}.at n=8A149261
- Self-convolution of sequence A001402.at n=17A160647
- Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and all but the outermost row or column zero.at n=38A162024
- Coefficients of a recursive polynomial based on Chaitin's S expressions: a(0)=1; a(1)=x; a(2)=1; a(n)=vector(a(n-1)).reverse(a(n-1)).at n=43A176703
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having genus k (see first comment for definition of genus).at n=31A177267