Properties of the Number 47100

Forty-Seven Thousand One Hundred

Basics

Value: 47099 → 47100 → 47101

Parity: even

Prime: No

Previous Prime: 47093

Next Prime: 47111

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 5 ² × 157

Divisors: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1011011111111100

Octal: 133774

Duodecimal: 23310

Hexadecimal: b7fc

Square: 2218410000

Square Root: 217.02534414210706

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)=6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223467

Regular triangle read by rows where T(n,k) is the number of labeled connected graphs with loops with n edges and k vertices, 1 <= k <= n+1. A322147

Imbalance of the sum of parts of all partitions of n. A194797

Irregular triangle read by rows where T(n,k) is the number of labeled connected loop-graphs covering n vertices with k edges. A369195

Triangle T(n,k) read by rows: the number of connected, loopless, non-oriented, vertex-labeled graphs with n >= 0 edges and k >= 1 vertices, allowing multi-edges. A290776

Triangle read by rows giving coefficients of Genocchi q-numbers B_n(1,q) (n >= 1) expanded in powers of q. A193762

6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of nX3 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223462

Number of binary words of length 2n with an even number of 1's which are not shuffle squares. A360412

6X6X6 triangular graph without horizontal edges coloring a rectangular array: number of n X n 0..20 arrays where 0..20 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 10,15 10,16 11,16 11,17 12,17 12,18 13,18 13,19 14,19 14,20 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223459

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 touches the line y=x/3 only at lattice points. A47100