Properties of the Number -31065

Thirty-One Thousand Sixty-Five

Basics

Value: -31066 → -31065 → -31064

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 19 × 109

Divisors: 1, 3, 5, 15, 19, 57, 95, 109, 285, 327

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111100101011001

Octal: -74531

Duodecimal: -15B89

Hexadecimal: -7959

Square: 965034225

Square Root: 176.2526595544022

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

Total number of occurrences of the pattern 1<2 in all preferential arrangements (or ordered partitions) of n elements. A240796

Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to either SmallGroup(2187,247)-#1;5 or SmallGroup(2187,247)-#1;9. A250242

Numbers k such that A003415(k) == A276085(k) (mod 2310), where A003415 is the arithmetic derivative and A276085 is the primorial base log-function. A391864

a(n) = (prime(n)⁴ - prime(n⁴))/2, where prime(n) is the n-th prime. A143682

Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically. A207596

T(2n,n), array T as in A047040. A47049

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (1, -1, 0), (1, 1, -1), (1, 1, 1)}. A149746

Number of ways to place zero or more nonadjacent 2,1 2,2 3,1 4,0 4,1 5,2 6,3 6,4 polyhexes in any orientation on a planar nXnXn triangular grid. A155438