Properties of the Number -49635

Forty-Nine Thousand Six Hundred Thirty-Five

Basics

Value: -49636 → -49635 → -49634

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 1103

Divisors: 1, 3, 5, 9, 15, 45, 1103, 3309, 5515, 9927

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100000111100011

Octal: -140743

Duodecimal: -24883

Hexadecimal: -c1e3

Square: 2463633225

Square Root: 222.7891379757999

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

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = 1, a(2) = 0. A81172

Number of n X 2 -1,1 arrays such that the sum over i=1..n, j=1..2 of i·x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 2-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship). A225338

Numbers of squares formed by this procedure on n-th step: Step 1, draw a unit square. Step n, draw a unit square with center in every intersection of lines of the figure in step n-1. A336288

Index k in A095773 where a string of n identical values occurs. A96183

a(n) = floor(sqrt(F(n+2)² + F(n)²)), where F(n) = A000045(n). A245271

Consecutive internal states of the linear congruential pseudo-random number generator (4096·s + 150889) mod 714025 when started at 1. A385465

a(n) = ∑_{k=0..floor(n/2)} binomial(n,2·k)*Fibonacci(k). A101890

Expansion of x² * (3+x-x²) / (1-x)⁴. A393231