Properties of the Number -41349

Forty-One Thousand Three Hundred Forty-Nine

Basics

Value: -41350 → -41349 → -41348

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 11 × 179

Divisors: 1, 3, 7, 11, 21, 33, 77, 179, 231, 537

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1010000110000101

Octal: -120605

Duodecimal: -1BB19

Hexadecimal: -a185

Square: 1709739801

Square Root: 203.34453521056327

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

Numbers k such that σ(k) = σ(k+5). A15865

Index in A092243 where -n first appears. A269738

Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k hills (i.e., ud's starting at level 0). (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).). A109191

Number of Grand Motzkin paths of length n and having no hills (i.e., no ud's starting at level 0). (A Grand Motzkin path of length n is a path in the half-plane x >= 0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).) A109192

Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k DUUU's. A135308