Properties of the Number -13064

Thirteen Thousand Sixty-Four

Basics

Value: -13065 → -13064 → -13063

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 23 × 71

Divisors: 1, 2, 4, 8, 23, 46, 71, 92, 142, 184

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11001100001000

Octal: -31410

Duodecimal: -7688

Hexadecimal: -3308

Square: 170668096

Square Root: 114.29785649783639

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

Inverse of Riordan array (1/(1-x)²,x(1-x)/(1+x)), A104698. A110271

Number T(n,k) of compositions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A261781

Numbers k such that 3^k + 32 is prime. A219048

T(n,k)=Number of length n+2 0..k arrays with no pair in any consecutive three terms totalling exactly k. A245995

T(n,k)=Number of length n+3 0..k arrays with some pair in every consecutive four terms totalling exactly k. A245950

Difference between larger and smaller terms of n-th amicable pair. A66539

Number of unlabeled nonseparable (or 2-connected) planar graphs with n edges. A343869

Fibonacci sequence beginning 2, 12. A22368

Numbers k such that k and k+1 both have 16 divisors. A274359

Difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933. A275469