Properties of the Number 98052

Ninety-Eight Thousand Fifty-Two

Basics

Value: 98051 → 98052 → 98053

Parity: even

Prime: No

Previous Prime: 98047

Next Prime: 98057

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 8171

Divisors: 1, 2, 3, 4, 6, 12, 8171, 16342, 24513, 32684

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10111111100000100

Octal: 277404

Duodecimal: 488B0

Hexadecimal: 17f04

Square: 9614194704

Square Root: 313.1325597889814

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

T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero. A200430

T(n,k)=Number of nXk 0..2 arrays with all horizontally or vertically connected equal values in a straight line, and new values 0..2 introduced in row major order. A223387

Number of 7/3+-power-free words over the alphabet {0,1}. A82380

Polynomial expansion sequence: p(x)=1/(1 - 4x + 5x² - 6x⁴ + 6x⁵ - x⁶ - 2x⁷ + x⁸). A143075

Expansion of ∏_{i>=2, j>=2} 1 / (1 - x^i·j)^j. A326830

Number of -6..6 arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero. A200428

Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two or three adjacent elements summing to zero. A200433

Number of n X 2 0..2 arrays with all horizontally or vertically connected equal values in a straight line, and new values 0..2 introduced in row major order. A223381

Number of nX7 0..2 arrays with all horizontally or vertically connected equal values in a straight line, and new values 0..2 introduced in row major order. A223386

T(n,k) counts the solid partitions of n that can be extended to a solid partition of n+1 in exactly (k+3) ways. Equivalently, the number of solid partitions of n that have exactly k+3 partitions of n+1 majoring them. A98052