Properties of the Number -9013

Thirteen

Basics

Value: -9014 → -9013 → -9012

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 9013

Divisors: 1, 9013

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10001100110101

Octal: -21465

Duodecimal: -5271

Hexadecimal: -2335

Square: 81234169

Square Root: 94.93682109698007

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

Triangle T(n,k), n>=1, 0<=k<=A000041(n), read by rows: row n gives the coefficients of the chromatic polynomial of the ranked poset L(n) of partitions of n, highest powers first. A213597

Prime numbers ending in the prime number 13. A244763

Primes with first digit 9. A45715

Values of n such that L(20) and N(20) 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. A227523

Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2ⁿ); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group. A39754

Primes such that the sum of the predecessor and successor primes is divisible by 41. A113157

Primes p with q(p) + 1 also prime, where q(.) is the strict partition function (A000009). A234530

Lower prime of a pair of consecutive primes having a difference of 16. A31934

Number of binary codes of length 5 with n words. A34190

Numbers n such that n, n+1 and n+2 are 1,2,3-almost primes. A112998