Properties of the Number 86625

Eighty-Six Thousand Six Hundred Twenty-Five

Basics

Value: 86624 → 86625 → 86626

Parity: odd

Prime: No

Previous Prime: 86599

Next Prime: 86627

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 ³ × 7 × 11

Divisors: 1, 3, 5, 7, 9, 11, 15, 21, 25, 33

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10101001001100001

Octal: 251141

Duodecimal: 42169

Hexadecimal: 15261

Square: 7503890625

Square Root: 294.32125305522874

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 read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing even cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries. For example, the permutation (18)(2347)(569) has 2 increasing even cycles. A186764

Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}. A147577

Triangular irregular array: T(n,k) is the number of permutations on n letters with k cycles where the cycle type set is [m] for some m. A392215

Expansion of e.g.f. theta₃^7/2. A15667

Third right hand column of triangle A163932. A163933

Steffensen's bracket function [n,n-3]. A241170

Successive integers produced by Conway's PRIMEGAME, starting with 12 rather than 2. A273099

Antidiagonal sums of square table A086623. A86625

Number of labeled pure 2-complexes on n nodes (0-simplexes) with 4 2-simplexes and 12 1-simplexes. A54647