Properties of the Number 47050

Forty-Seven Thousand Fifty

Basics

Value: 47049 → 47050 → 47051

Parity: even

Prime: No

Previous Prime: 47041

Next Prime: 47051

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 ² × 941

Divisors: 1, 2, 5, 10, 25, 50, 941, 1882, 4705, 9410

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011011111001010

Octal: 133712

Duodecimal: 2328A

Hexadecimal: b7ca

Square: 2213702500

Square Root: 216.91011963483862

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

Triangle read by rows: T(n,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares. A331452

Transform of the finite sequence (1, 0, -1, 0, 1) by the T_0,0 transform (see link). A159348

Numbers k such that prime(k) * 2^k - 1 is prime. A239741

E.g.f. satisfies A(x) = 1/(1 - x·exp(x·A(x)²))². A377552

Indices of primes in sequence defined by A(0) = 49, A(n) = 10·A(n-1) - 11 for n > 0. A101733

Sum of squares of cycle lengths for different cycles in Fibonacci-like sequences modulo n. A233246

Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=4x/3 unless x=0 or x=h. A47050