Properties of the Number 48592

Forty-Eight Thousand Five Hundred Ninety-Two

Basics

Value: 48591 → 48592 → 48593

Parity: even

Prime: No

Previous Prime: 48589

Next Prime: 48593

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 3037

Divisors: 1, 2, 4, 8, 16, 3037, 6074, 12148, 24296, 48592

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110111010000

Octal: 136720

Duodecimal: 24154

Hexadecimal: bdd0

Square: 2361182464

Square Root: 220.43593173527768

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 compositions of the integer n with strictly smallest part in the first position. A79501

T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A234233

Number of (n+1) X (1+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A234228

Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A234230

Values n, where n = p·q, and n, p, and q together contain all 10 digits at least once, and no digit is in more than one of n, p or q. A253173

Pisot sequence L(9,10). A48592