Properties of the Number 49072

Forty-Nine Thousand Seventy-Two

Basics

Value: 49071 → 49072 → 49073

Parity: even

Prime: No

Previous Prime: 49069

Next Prime: 49081

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 3067

Divisors: 1, 2, 4, 8, 16, 3067, 6134, 12268, 24536, 49072

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111110110000

Octal: 137660

Duodecimal: 24494

Hexadecimal: bfb0

Square: 2408061184

Square Root: 221.52200793600622

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(1) = 2; a(n+1) = a(n) + p, where p is the largest prime <= a(n). A123196

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

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

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A026082. A26085

Expansion of 1/(1 - 3·x + 4·x²). A49072

a(n) = (16·n + 1)*(2592·n² + 288·n + 7). A348643

Number of (n+1)X(4+1) 0..2 arrays with the minimum plus the maximum unequal to the lower median plus the upper median in every 2X2 subblock. A235907