Properties of the Number 32798

Thirty-Two Thousand Seven Hundred Ninety-Eight

Basics

Value: 32797 → 32798 → 32799

Parity: even

Prime: No

Previous Prime: 32797

Next Prime: 32801

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 23 ² × 31

Divisors: 1, 2, 23, 31, 46, 62, 529, 713, 1058, 1426

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000000011110

Octal: 100036

Duodecimal: 16B92

Hexadecimal: 801e

Square: 1075708804

Square Root: 181.10218110227166

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Number of 2 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;0) and (01;1). A100314

a(n) = 3·a(n-1) - 2·a(n-2) - a(n-3) + a(n-4) with n>3, a(0)=1, a(1)=2, a(2)=3, a(3)=7. A131300

Row sums of triangle A173302. A173303

Numerators of continued fraction convergents to sqrt(703). A42352

Expansion of 1/((1-x)²*(1-2·x+2·x²)). A279230

Starts of runs of 3 consecutive numbers whose powerful part is larger than their powerfree part (A328014). A348120

a(n) = floor(n*(n³-n-3)/(2*(n-1))). A117561

Triangle read by rows: coefficients of a Bessel polynomial recursion: P(x, n) = 2*(n-1)*P(x, n - 1)/x - n·P(x, n - 2) with substitution x -> 1/y. A136668

Number of (n+1) X (4+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction. A250738

Integers n such that core(n), core(n+1), core(n+2) are smaller than n^1/2 where core(n) is A007913(n), the squarefree part of n. A260212