Properties of the Number 48708

Forty-Eight Thousand Seven Hundred Eight

Basics

Value: 48707 → 48708 → 48709

Parity: even

Prime: No

Previous Prime: 48679

Next Prime: 48731

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 11 × 41

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: 1011111001000100

Octal: 137104

Duodecimal: 24230

Hexadecimal: be44

Square: 2372469264

Square Root: 220.69888989299426

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 3 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically. A207590

Take apart the sides of each of the integer-sided triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total volume of all rectangular prisms enclosed in this way. A308233

Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions. A187158

Number of transfer systems on the horizontal join lattice [n]*[n]. A392811

T(n,k) = Number of n X k 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically. A207589

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 0 and 1 1 1 vertically. A208501

a(n) is the number of coverings of 1..n by cyclic words of length 3, such that each value from 1 to n appears precisely 3 times. That is, the union of all the letters in all of the words of a given covering is the multiset {1,1,1,2,2,2,...,n,n,n}. Repeats of words are allowed in a given covering. A108242

a(n) is the number of coverings of 1..n by cyclic words of length n, such that each value from 1 to n appears precisely 3 times. That is, the union of all the letters in all of the words of a given covering is the multiset {1,1,1,2,2,2,...,n,n,n}. Repeats of words are not allowed in a given covering. A110105

Numerators of ratios converging to the Thue-Morse constant, converted to hexadecimal. A48708

Number of nX6 0..1 arrays with no 1 equal to more than one of its king-move neighbors. A282645