Properties of the Number -48618

Forty-Eight Thousand Six Hundred Eighteen

Basics

Value: -48619 → -48618 → -48617

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 37 × 73

Divisors: 1, 2, 3, 6, 9, 18, 37, 73, 74, 111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1011110111101010

Octal: -136752

Duodecimal: -24176

Hexadecimal: -bdea

Square: 2363709924

Square Root: 220.4948979001555

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

a(n) = ∑_{k=0..floor(n/9)} (-1)^k*binomial(n,9·k). A307045

a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers. A59270

Number of different ways to select n elements from two sets of n elements under the precondition of choosing at least one element from each set. A115112

Irregular triangle read by rows: T(n,d) (n >= 1, d <= n-1 for n>1) = number of n X n integer-valued matrices M such that M_1,1=0, M_n,n=d, M_(i+1),j = M_i,j + (0 or 1), M_i,(j+1) = M_i,j + (0 or 1), and M_(i+1),(j+1) = M_i,j + (0 or 1). A323848

s(k)-s(j), where (s(k),s(j)) is the least pair of central binomial coefficients for which n divides their difference. A205014

Triangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone. A259051

a(n) = n*(2·n + 1)*(4·n + 1). A316224

a(n) = 18*(n - 2)*(2·n - 5). A60787

A115112 with initial term changed from 0 to 1. A171074

Ordered differences of central binomial coefficients. A205008