Properties of the Number 6943

Six Thousand Nine Hundred Forty-Three

Basics

Value: 6942 → 6943 → 6944

Parity: odd

Prime: No

Previous Prime: 6917

Next Prime: 6947

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 53 × 131

Divisors: 1, 53, 131, 6943

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: Yes

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1101100011111

Octal: 15437

Duodecimal: 4027

Hexadecimal: 1b1f

Square: 48205249

Square Root: 83.32466621595313

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

Expansion of 1/sqrt((1-x)² - 4·x³). A98479

Nonprime Heinz numbers of multiples of triangular partitions, or of finite arithmetic progressions with offset 0. A325407

a(n) = (2·n + 1)*(5·n + 1). A33571

a(n) = (9·n² + 5·n + 2)/2. A64225

Write n as a sum of distinct powers of 2, then take the primes of those powers of 2 and multiply them together. A325094

Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n. A77405

Permutation of natural numbers: a(1) = 1, a(A065621(n)) = A014580(a(n-1)), a(A048724(n)) = A091242(a(n)), where A065621(n) and A048724(n) are the reversing binary representation of n and -n, respectively, and A014580 resp. A091242 are the binary coded irreducible resp. reducible polynomials over GF(2). A246164

a(n) = prime(n) * prime(2n). A319613

An auxiliary bit-mask sequence for computing A066425. (The "dirty", unsymmetric one). A68222

Semiprimes p such that next semiprime after p is p + 10. A217030