Properties of the Number -13570

Thirteen Thousand Five Hundred Seventy

Basics

Value: -13571 → -13570 → -13569

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 23 × 59

Divisors: 1, 2, 5, 10, 23, 46, 59, 115, 118, 230

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11010100000010

Octal: -32402

Duodecimal: -7A2A

Hexadecimal: -3502

Square: 184144900

Square Root: 116.4903429473877

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 edges formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares). A331765

G.f. A(x) satisfies A(x) = 1 + x·A(x)⁴ / (1 - x). A349331

Number of ways to split an integer partition of n into contiguous subsequences with strictly increasing sums. A336134

Consider the sum of the divisors of a number x>1. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach x. A269307

Number of compositions (ordered partitions) of n into distinct squarefree parts. A331846

Number of isomorphism classes of anti-commutative closed binary operations on a set of order n, listed by class size. A79191

Number of n X n ortho-projection matrices over GF(2). Also, the number of labeled ortho-projection graphs on n vertices. A81080

a(n) = (3·n+1)*(3·n+4). A85001

The Wiener index of the P₃ X P_n grid, where P_m is the path graph on m nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph. A180569

Numbers n such that A003145(n) = floor(α²*n)+1, where α = 1.839... is the positive real zero of x³-x²-x-1. A278352