Properties of the Number -48896

Forty-Eight Thousand Eight Hundred Ninety-Six

Basics

Value: -48897 → -48896 → -48895

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 35

Digital Root: 8

Palindrome: No

Factorization: 2 ⁸ × 191

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 191, 256

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011111100000000

Octal: -137400

Duodecimal: -24368

Hexadecimal: -bf00

Square: 2390818816

Square Root: 221.12439937736406

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

Imaginary parts of the recursive sequence a(n+2) = ∑_k=0..n binomial(n,k)*a(k)*a(n+1-k), with a(0)=2, a(1)=2i. A289089

Fourier coefficients of the modular form (1/t_3A) * sqrt(1 - 108/t_3A) * F_3A¹⁰. A341555

Expansion of (1-x)^-1/(1-x+2·x²-x³). A77875

a(n) = 2ⁿ*tetranacci(n) or (2ⁿ)*A001648(n). A127216

Expansion of (2/π)*elliptic_E(k) in powers of q. A194094

Array read by antidiagonals: Solutions to Schmidt's Problem. A94424

a(n) = (3·2ⁿ - 2) * 2ⁿ. A165665

a(n) = 2·a(n-1) + 2·a(n-2) - 4·a(n-3) with n>2, a(0)=0, a(1)=1, a(2)=3. A135094

Sum over all partitions of n into distinct parts of the bitwise XOR of the parts. A306925

a(n) = A341886(n)/2; numbers k such that A307437(k) is even. A341887