6598
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9900
- Proper Divisor Sum (Aliquot Sum)
- 3302
- 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
- 3298
- Möbius Function
- 1
- Radical
- 6598
- Omega Function (Ω)
- 2
- 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
- 31
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- sec(sinh(x)+tan(x))=1+4/2!*x^2+104/4!*x^4+6598/6!*x^6+778200/8!*x^8...at n=3A013054
- Conjectured formula for irreducible 5-fold Euler sums of weight 2n+13.at n=35A019450
- Sequence satisfies T(a)=a, where T is defined below.at n=52A027597
- 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 80.at n=12A031578
- Number of partitions of n into parts not of the form 25k, 25k+8 or 25k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=31A036007
- Shifts left under transform T where Ta is phi DCONV a.at n=47A038045
- Number of partitions of n into Fibonacci parts if each part is of two kinds.at n=20A103577
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k triple descents (i.e., ddd's).at n=30A108443
- Bond series for first parallel moment of 4.8 (bathroom tile) lattice.at n=18A120554
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=12A166537
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209417; see the Formula section.at n=52A209418
- Number of k < 10^n such that A047988(k) = 1.at n=3A213530
- Consider the ordered Goldbach partitions of the even numbers m. Then a(n) is the least m which contains prime(n) such partitions composed of odd primes.at n=35A216047
- Numbers n such that Q(sqrt(n)) has class number 7.at n=21A218039
- Number of (n+1)X(2+1) 0..3 arrays x(i,j) with every row sum{j*x(i,j), j=1..2+1} equal, and every column sum{i*x(i,j), i=1..n+1} equal, with top left element <= 1.at n=8A232524
- T(n,k) = number of (n+1) X (k+1) 0..3 arrays x(i,j) with every row sum{j*x(i,j), j=1..k+1} equal, and every column sum{i*x(i,j), i=1..n+1} equal, with top left element <= 1.at n=46A232526
- Number of (n+2) X (5+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=0A252637
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=10A252640
- Number of (1+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 4 6 or 7.at n=4A252641
- Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime and no consecutive values equal.at n=24A255718