Properties of the Number -6869

Eight Hundred Sixty-Nine

Basics

Value: -6870 → -6869 → -6868

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 6869

Divisors: 1, 6869

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1101011010101

Octal: -15325

Duodecimal: -3B85

Hexadecimal: -1ad5

Square: 47183161

Square Root: 82.87943049997388

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

Primes formed by concatenating n with n+1. A30458

Primes that do not contain any other prime as a proper substring. A33274

Number of paths in the first quadrant from (0,0) to (n,0) using steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0). A128720

Balanced primes of order three. A82078

a(n) = 1·2 + 3·4 + 5·6 + 7·8 + 9·10 + 11·12 + 13·14 + ... + (up to n). A228958

Primes whose decimal expansion is a concatenation of two or more consecutive increasing numbers (no leading zeros allowed). A52087

Number of toroidal necklaces of positive integers summing to n. A323858

Number of ways to write n as a nonnegative linear combination of a strict integer partition. A365002

T(n,k)=Number of nXk 0..1 arrays with diagonals and antidiagonals unimodal and rows nondecreasing. A223949

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0. A267338