Properties of the Number 86856

Eighty-Six Thousand Eight Hundred Fifty-Six

Basics

Value: 86855 → 86856 → 86857

Parity: even

Prime: No

Previous Prime: 86851

Next Prime: 86857

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 7 × 11 × 47

Divisors: 1, 2, 3, 4, 6, 7, 8, 11, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10101001101001000

Octal: 251510

Duodecimal: 42320

Hexadecimal: 15348

Square: 7543964736

Square Root: 294.71342012198903

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, m) = T(n-1, m-1) + (4m-3)*T(n-1, m) read by rows 1<=m<=n. A111578

Heinz number of the multiset of differences between consecutive divisors of n. A328023

a(n) is the number of distinct (modulo geometric D3-operations) nonsymmetric (no reflective nor rotational symmetry) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells. A60552

Triangle read by rows: T(n,k) = one-half number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1. T(1,0) = 1 by convention. A86856