Properties of the Number -23020

Twenty-Three Thousand Twenty

Basics

Value: -23021 → -23020 → -23019

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 5 × 1151

Divisors: 1, 2, 4, 5, 10, 20, 1151, 2302, 4604, 5755

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101100111101100

Octal: -54754

Duodecimal: -113A4

Hexadecimal: -59ec

Square: 529920400

Square Root: 151.7234326002414

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

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 5·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2·x - x². A367299

Numbers k such that there are exactly four biquadratefree powerful numbers (A338325) between k² and (k+1)². A338391

Array read by antidiagonals: T(m,n) (m >= 1, n >= 1) = number of reduced connected row convex (RCRC) constraints between an m-element set and an n-element set. A372066

Number of asymmetric mobiles (circular rooted trees) with n nodes and 4 leaves. A55365

a(n) = 1000·n + 20. A157510

Sequence A261220 shown in factorial base: a(n) = A007623(A261220(n)). A260743

a(n) = (∑_k=0..n-1 (-1)^k * (4k+1) * 160^n-1-k * C(2k,k) * ∑_j=0..k C(k,j) * C(k+2j,2j) * C(2j,j) * (-20)^k-j) / (n·C(2n,n)). A337247

A064637 converted to factorial base. A64477

a(n) = (n+1)*(n³+15·n²+74·n+132)/12. A217947

The sum of the numbers on the perimeter of the n X n diamond frame, located at the top of the numerical pyramid containing the positive integers in natural order. A359096