Properties of the Number 47917

Forty-Seven Thousand Nine Hundred Seventeen

Basics

Value: 47916 → 47917 → 47918

Parity: odd

Prime: Yes

Previous Prime: 47911

Next Prime: 47933

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 47917

Divisors: 1, 47917

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101100101101

Octal: 135455

Duodecimal: 23891

Hexadecimal: bb2d

Square: 2296038889

Square Root: 218.89952032839176

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) = a(n-1) + a(round(2*(n-1)/3)) + a(round((n-1)/3)) with a(1)=a(2)=1. A33499

a(n) = n³ - 2·n² + 2. A100109

a(n) = 44·n² + 1. A158630

Number of integers in n-th generation of tree T(3^-1/2) defined in Comments. A274157

Primes p such that (p²+2)/3 and (p⁴+2)/3 are prime. A256811

Number of nX6 0..1 arrays with every element equal to 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero. A298053

a(n)=the sum of the (1,2)- and (1,3)-entries and twice the (1,4)-entry of the matrix Pⁿ + Tⁿ, where the 4 X 4 matrices P and T are defined by P=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,0] and T=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,1]. A109526

Positive integers k such that k divides 12^k - 1. A14951

T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero. A298055

Triangular array read by rows: a(n,k) = φ(n/k)*(n/k)^k*k!/n if k∣n else 0 (1<=k<=n). A47917