Properties of the Number 71049

Seventy-One Thousand Forty-Nine

Basics

Value: 71048 → 71049 → 71050

Parity: odd

Prime: No

Previous Prime: 71039

Next Prime: 71059

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 2153

Divisors: 1, 3, 11, 33, 2153, 6459, 23683, 71049

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10001010110001001

Octal: 212611

Duodecimal: 35149

Hexadecimal: 11589

Square: 5047960401

Square Root: 266.5501828924527

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) = 58·n² - 1. A158668

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, -1), (1, -1, -1), (1, 1, 1)}. A149593

Let sequence B_n={b_m} be defined by: b₁=prime(n), b₂=prime(n+1); for m>=3, b_m=b_m-2+b_m-1 if b_m-2+b_m-1 is not semiprime, otherwise b_m is the least prime divisor of b_m-2+b_m-1. Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded. A221218

Number of 1's in n-th generation of 1-D CA using Rule 110, started with a single 1. A71049

Number of (n+1)X2 0..5 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A203937