Properties of the Number -67684

Sixty-Seven Thousand Six Hundred Eighty-Four

Basics

Value: -67685 → -67684 → -67683

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 16921

Divisors: 1, 2, 4, 16921, 33842, 67684

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10000100001100100

Octal: -204144

Duodecimal: -33204

Hexadecimal: -10864

Square: 4581123856

Square Root: 260.161488310626

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: T(n,k) is the number of Dyck paths of semilength n having k peak plateaux (0<=k<=floor(n/2)). A peak plateau is a run of consecutive peaks that is preceded by an upstep and followed by a down step; a peak consists of an upstep followed by a downstep. A143952

Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k peaks (n >= 2, k >= 1). A271940

Complexity of computing the Fourier transform on the symmetric group S_n. A323945

Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at even heights. A101919

Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at an odd height. A101920

Triangle read by rows: T(n,k) is number of ordered trees with n edges and having exactly k vertices all of whose children are leaves (1<=k<=floor(n/2) for n>=2). A114502