Properties of the Number 49062

Forty-Nine Thousand Sixty-Two

Basics

Value: 49061 → 49062 → 49063

Parity: even

Prime: No

Previous Prime: 49057

Next Prime: 49069

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 13 × 17 × 37

Divisors: 1, 2, 3, 6, 13, 17, 26, 34, 37, 39

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011111110100110

Octal: 137646

Duodecimal: 24486

Hexadecimal: bfa6

Square: 2407079844

Square Root: 221.4994356651953

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

Number of linear intervals in the Tamari lattices. A344136

Expansion of (1+x²*C)*C³, where C = (1-(1-4·x)^1/2)/(2·x) is g.f. for Catalan numbers, A000108. A71718

Maximum number of 6 sphinx tile shapes in a sphinx tiled hexagon of order n. A291582

a(n) = sqrt((x² - y²)*x·y/c) where·is A364108(n), y is A364109(n) and c is A006991(n). A364110

Ordered product of the sides of primitive Pythagorean triangles divided by 60. A81752

Squarefree oblong (pronic) numbers having an odd number of prime factors. A98827

Oblong numbers which are products of five distinct primes. A359304

Rectangular array neg(i,j,1,2) read by descending antidiagonals: pos() and neg() denote the positive part and negative part of a determinant; see Comments. A380661

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062

G.f. A(x) satisfies: A(x) = A( x⁵ + 5·x*A(x)⁵ )^1/5, with A(0)=0, A'(0)=1. A271931