Properties of the Number -22048

Twenty-Two Thousand Forty-Eight

Basics

Value: -22049 → -22048 → -22047

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 13 × 53

Divisors: 1, 2, 4, 8, 13, 16, 26, 32, 52, 53

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101011000100000

Octal: -53040

Duodecimal: -10914

Hexadecimal: -5620

Square: 486114304

Square Root: 148.48568954616468

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 partitions of n whose median is not a part. A238479

Starts of runs of 3 consecutive factorial base Niven numbers (A118363). A328206

Number of integer partitions of n whose distinct parts have integer mean. A360241

Numbers n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6·k+5 for some k, where prime(n) denotes n-th prime. A90835

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the sum of its diagonal elements less than the absolute difference of its antidiagonal elements. A250973

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-1,-2) (-2,-1) (0,-1) or (-1,0) and new values introduced in order 0..2. A274803

Triangle of coefficients of polynomials u(n,x) jointly generated with A210601; see the Formula section. A210600

a(n) = (prime(n))² - (nonprime(n))². A161757

Number of unlabeled simple graphs with n nodes of 2 colors whose components are path graphs. A217194

Numbers k such that each of k, k+1, k+2, and k+4 is a sum of two squares. A328224