Properties of the Number 48953

Forty-Eight Thousand Nine Hundred Fifty-Three

Basics

Value: 48952 → 48953 → 48954

Parity: odd

Prime: Yes

Previous Prime: 48947

Next Prime: 48973

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 48953

Divisors: 1, 48953

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111100111001

Octal: 137471

Duodecimal: 243B5

Hexadecimal: bf39

Square: 2396396209

Square Root: 221.25324856372166

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

T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals. A202777

Length of the shorts leg in the unique primitive Pythagorean triple whose inradius is A000032(n) and such that its long leg and its hypotenuse are consecutive natural numbers. A380821

a(n) = A014217(n+3) - A014217(n). A153263

Primes p such that A001414(p+1) = A001414(p-1) - 1. A342823

a(n) = least m such that if r and s in {F(h)/F(2·h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers). A24831

Lesser of two Pythagorean primes for which the Pythagorean triangles have the same area. A157184

Number of (n+2)X5 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals. A202772

Number of (n+2)X9 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals. A202776

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 489", based on the 5-celled von Neumann neighborhood. A272512

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=1, k=0 and l=-2. A176753