Properties of the Number 47064

Forty-Seven Thousand Sixty-Four

Basics

Value: 47063 → 47064 → 47065

Parity: even

Prime: No

Previous Prime: 47059

Next Prime: 47087

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 37 × 53

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 37, 53

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011011111011000

Octal: 133730

Duodecimal: 232A0

Hexadecimal: b7d8

Square: 2215020096

Square Root: 216.94238866574693

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

Number of base 10 n-digit numbers with adjacent digits differing by one or less. A126364

'Reverse and Add!' trajectory of 10563. A63063

a(n) = 1728·n - 1320. A157263

Number of n X n binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally. A188860

Triangle I(m,n) read by rows: number of perfect lattice paths on the m·n board. A296449

Triangle read by rows: T(n,m) = ∑_i=0..n+1 C(n-i+1,i-1)*C(n-i+1,i)*C(n-i+1,m-i+1). A298309

T(n,k) is the number of n X k binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally. A188866

Integers n > 10563 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10563. A63064

a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063064 in order to obtain a term in the trajectory of 10563. A63065

T(n,n-2), array T as in A047060. A47064