Properties of the Number -279106

Two Hundred Seventy-Nine Thousand One Hundred Six

Basics

Value: -279107 → -279106 → -279105

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 17 × 8209

Divisors: 1, 2, 17, 34, 8209, 16418, 139553, 279106

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1000100001001000010

Octal: -1041102

Duodecimal: -11562A

Hexadecimal: -44242

Square: 77900159236

Square Root: 528.304836245136

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

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