Properties of the Number -68286

Sixty-Eight Thousand Two Hundred Eighty-Six

Basics

Value: -68287 → -68286 → -68285

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: Yes

Factorization: 2 × 3 × 19 × 599

Divisors: 1, 2, 3, 6, 19, 38, 57, 114, 599, 1198

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -10000101010111110

Octal: -205276

Duodecimal: -33626

Hexadecimal: -10abe

Square: 4662977796

Square Root: 261.3159007791145

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

T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the permanents of 2X2 subblocks nondecreasing rightwards and downwards. A204723

Smallest multiple k·n of n which has even digits and is a palindrome or becomes a palindrome when 0's are added on the left (e.g., 10 becomes 010, which is a palindrome). A62293

T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with rows and columns of permanents of all 2 X 2 subblocks lexicographically nondecreasing. A204962

Obtain m by omitting trailing zeros from n; a(n) = smallest multiple k·m which is a palindrome with even digits, or -1 if no such multiple exists. A61915

Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 8. A244537

Number of (n+1) X 2 0..1 arrays with the permanents of 2 X 2 subblocks nondecreasing rightwards and downwards. A204716