Properties of the Number 47974

Forty-Seven Thousand Nine Hundred Seventy-Four

Basics

Value: 47973 → 47974 → 47975

Parity: even

Prime: No

Previous Prime: 47969

Next Prime: 47977

Digit Sum: 31

Digital Root: 4

Palindrome: Yes

Factorization: 2 × 17 ² × 83

Divisors: 1, 2, 17, 34, 83, 166, 289, 578, 1411, 2822

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101101100110

Octal: 135546

Duodecimal: 2391A

Hexadecimal: bb66

Square: 2301504676

Square Root: 219.02967835432713

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 nXk 0..2 arrays with no element equal to exactly one horizontal or vertical neighbor, with new values 0..2 introduced in row major order. A241078

Palindromes which are sums of two consecutive primes. A162571

a(n) = a(n-1) + a(n-2) - n·a(floor(n/2)), where a(0) = 1, a(1) = 2, a(2) = 3. A298401

Number of nX4 0..2 arrays with no element equal to exactly one horizontal or vertical neighbor, with new values 0..2 introduced in row major order. A241075

Number of nX5 0..2 arrays with no element equal to exactly one horizontal or vertical neighbor, with new values 0..2 introduced in row major order. A241076

Numbers n such that 257·2ⁿ-1 is prime. A50887

a(n) = a(n-1) + 2*(n-1)*a(n-2). A47974

Array read by ascending antidiagonals. T(n, k) = n!*[xⁿ] exp(x + (k/2) * x²). A generalization of the number of involutions (or of 'telephone numbers'). A359762

a(n) = 2·a(n-1)+(n-2)*a(n-2)-(n-1)*a(n-3) with initial terms (1,2,4). A245176