Properties of the Number 49631

Forty-Nine Thousand Six Hundred Thirty-One

Basics

Value: 49630 → 49631 → 49632

Parity: odd

Prime: No

Previous Prime: 49627

Next Prime: 49633

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 31 × 1601

Divisors: 1, 31, 1601, 49631

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100000111011111

Octal: 140737

Duodecimal: 2487B

Hexadecimal: c1df

Square: 2463236161

Square Root: 222.78016069659344

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) = n*(5·n² - 2)/3. A4466

G.f. satisfies A(x) = 1 + x·A(x)³ + x³*A(x)². A367058

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 294", based on the 5-celled von Neumann neighborhood. A287505

Sequence shifts left ten places under Weigh transform with a(n) = signum(n) for n<10. A316082

Concatenation of n-th perfect number and n-th Mersenne prime A000668(n). A138833

a(n) = N^1/4 * log(N) / sqrt(log(log(N))) rounded to nearest integer, with N=2ⁿ. Related to operation count of the deterministic factorization of an integer N using an improved Pollard-Strassen method. A309916

Number of 4Xn 0..2 arrays with rows and antidiagonals unimodal and columns nondecreasing. A223921

a(n) = ∑_{i=0..floor(n/2)} T(2i+1,n-2i-1) where T is A049627. A49631

(n+1)-st term of the n-th binomial transform of this sequence equals 1 for all n>=0. A89974