Properties of the Number -49101

Forty-Nine Thousand One Hundred One

Basics

Value: -49102 → -49101 → -49100

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 13 × 1259

Divisors: 1, 3, 13, 39, 1259, 3777, 16367, 49101

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1011111111001101

Octal: -137715

Duodecimal: -244B9

Hexadecimal: -bfcd

Square: 2410908201

Square Root: 221.58745451852639

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

a(n) = ∑_i=0..n (-2)ⁱ*binomial(n,i)*B(i) where B(n) = Bell numbers A000110(n). A124311

T(n,k)=Number of nXk binary arrays with top left value 1 and no two ones adjacent horizontally, vertically, diagonally or antidiagonally. A228506

Generalized Fibonacci numbers. A6603

Signed generalized Fibonacci numbers. A80244

Numbers n such that 9·10ⁿ + 8·R_n - 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n. A103108

Number of nX5 binary arrays with top left value 1 and no two ones adjacent horizontally, vertically, diagonally or antidiagonally. A228503

Number of nX7 binary arrays with top left value 1 and no two ones adjacent horizontally, vertically, diagonally or antidiagonally. A228505

Binomial transform of [1, 4, 10, 20, 0, 0, 0, ...]. A143131

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (1, -1, 0), (1, 0, 1), (1, 1, 1)}. A150746