Properties of the Number -28943

Twenty-Eight Thousand Nine Hundred Forty-Three

Basics

Value: -28944 → -28943 → -28942

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 103 × 281

Divisors: 1, 103, 281, 28943

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111000100001111

Octal: -70417

Duodecimal: -148BB

Hexadecimal: -710f

Square: 837697249

Square Root: 170.12642357964268

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

a(n) = ∑_{k <= n/2} k·binomial(n-2k, 3k+1). A137360

a(n) = 3^n-1*(2·n-3) + 2ⁿ⁺¹. A84643

Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of six and m runs through the set of least numbers whose prime signature is a partition of n. A309921

Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of eight and m runs through the set of least numbers whose prime signature is a partition of n. A309923

Brilliant numbers k such that 2k+1 is also brilliant. A85649

Number of length 4+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero. A250279

Consecutive states of the linear congruential pseudo-random number generator (1255·s + 6173) mod 29282 when started at s=1. A385339

a(1) = a(2) = 1. For n >=3, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, below a(n-1) if such a positive integer exists. Otherwise, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, above a(n-1). A118627