Properties of the Number -28334

Twenty-Eight Thousand Three Hundred Thirty-Four

Basics

Value: -28335 → -28334 → -28333

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 31 × 457

Divisors: 1, 2, 31, 62, 457, 914, 14167, 28334

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110111010101110

Octal: -67256

Duodecimal: -14492

Hexadecimal: -6eae

Square: 802815556

Square Root: 168.32706258947192

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

Triangle read by rows: row n gives coefficients of increasing powers of·in the polynomial (-1)ⁿ*p(n), where p(n) is defined as follows. Let f(n) = n*(n+1)/2, g(n) = f(n)+1; then p(-1) = 0, p(0) = 1 and for n >= 1, p(n) = (x - f(n))*p(n - 1) - g(n - 1)²*p(n - 2). A135049

Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges. A339560

Number of partitions of n having no parts with multiplicity 3. A118807

Number of integer partitions of n such that every pair of distinct parts has a different product. A325856

Sum of next n composite numbers. A72475

Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant in the closed interval [-n,n]. A211031

Number of sets of distinct primes, the greatest of which is prime(n), whose arithmetic mean is an integer. A82552

The number of ways that a straight line segment of length n, marked into n equal units, can be surrounded in a plane by one layer of regular polygons of unit edge that fit together without any gaps or overlaps, such that every polygon shares either a vertex or an exact unit edge with the segment. ("Line wreaths of length n.") Ways that differ by reflection or rotation are not counted as different. A158091

a(n) = (1/3)*n³ - n² - (1/3)*n - 1. A109620

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (1, -1, 1), (1, 0, 1), (1, 1, -1)}. A148904