Properties of the Number 47916

Forty-Seven Thousand Nine Hundred Sixteen

Basics

Value: 47915 → 47916 → 47917

Parity: even

Prime: No

Previous Prime: 47911

Next Prime: 47917

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 11 ³

Divisors: 1, 2, 3, 4, 6, 9, 11, 12, 18, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101100101100

Octal: 135454

Duodecimal: 23890

Hexadecimal: bb2c

Square: 2295943056

Square Root: 218.8972361634564

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

Diagonal in array of n-gonal numbers A081422. A81437

T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order. A267911

Numbers of the form (6ⁱ)*(11^j), with i, j >= 0. A108698

T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements. A203934

Primitive exponential abundant numbers: the powerful terms of A129575. A328136

Numbers of the form p³*q²*r² where p, q, and r are distinct primes. A179695

Exponential unitary abundant numbers: numbers k such that A322857(k) > 2·k. A383693

Number of pairs with two different elements which can be obtained by selecting unique elements from two sets with n+1 and n² elements respectively and n common elements. A85490

a(n) = n²*(n-1)³/4. A19584

Primitive exponential unitary abundant numbers: the powerful terms of A383693. A383694