Properties of the Number -13013

Thirteen Thousand Thirteen

Basics

Value: -13014 → -13013 → -13012

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 7 × 11 × 13 ²

Divisors: 1, 7, 11, 13, 77, 91, 143, 169, 1001, 1183

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11001011010101

Octal: -31325

Duodecimal: -7645

Hexadecimal: -32d5

Square: 169338169

Square Root: 114.07453703609758

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

Values of n such that L(12) and N(12) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227515

a(n) = binomial(n+5,5)*(n+3)/3. A40977

Multiples of 13 containing a 13 in their decimal representation. A121033

Number of integer partitions of n without choosable initial intervals. A387118

Triangle read by rows: T(n,k) = T(n-1,k-1) + k²*T(n-1,k), 1 < k <= n, T(n,1) = 1. A36969

Triangle read by rows. Stirling set numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + k²*T(n-1, k), for 0 <= k <= n. A269945

Partial sums of A002419. A51843

A statistic on orbital systems over n sectors: the number of orbitals with k restarts. A274880

Number of aperiodic toroidal necklaces of positive integers summing to n. A323866

Triangle of central factorial numbers T(2·n,2·n-2·k), k >= 0, n >= 1 (in Riordan's notation). A8957