Properties of the Number 28881

Twenty-Eight Thousand Eight Hundred Eighty-One

Basics

Value: 28880 → 28881 → 28882

Parity: odd

Prime: No

Previous Prime: 28879

Next Prime: 28901

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 3209

Divisors: 1, 3, 9, 3209, 9627, 28881

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000011010001

Octal: 70321

Duodecimal: 14869

Hexadecimal: 70d1

Square: 834112161

Square Root: 169.94410845922255

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

Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++. A96558

Expansion of 1/(2 - ∏_k>=2 1/(1 - x^k)). A307057

a(n) = 20·n² + 1. A158493

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n k^j * j! * binomial(n,j)². A341014

Total number of odd parts in the last section of the set of partitions of n. A206433

a(n) = 80·n² + 1. A158776

Noncube integers n such that n² + 1 is the sum of 2 positive cubes. A267119

a(n) = n² - 7. A28881

Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 1432. 0 <= k <= A100354(n). A342864

Irregular table read by rows: Take a Reuleaux triangle with all diagonals drawn, as in A340639. Then T(n,k) = number of k-sided polygons in that figure for k >= 3. A340614