Properties of the Number 81396

Eighty-One Thousand Three Hundred Ninety-Six

Basics

Value: 81395 → 81396 → 81397

Parity: even

Prime: No

Previous Prime: 81373

Next Prime: 81401

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 7 × 17 × 19

Divisors: 1, 2, 3, 4, 6, 7, 9, 12, 14, 17

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011110111110100

Octal: 236764

Duodecimal: 3B130

Hexadecimal: 13df4

Square: 6625308816

Square Root: 285.29984227124976

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

MacMahon's generalized sum of divisors function. A2128

Triangle read by rows, where the g.f. satisfies A(x, y) = 1 + x·A(x, y)² + x·y*A(x, y)³. A104978

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k peaks of the form Ud. A108426

a(n) = (n-3)*(n-2)*(n-1)*n*(n+1)/30. A210569

a(n) = ∑_{k=0..floor(n/2)} binomial(k+3,4·n-8·k+3). A390040

a(n) = ∑_{k=0..floor(2·n/7)} binomial(2·k+1,2·n-7·k). A392456

a(n) = (n-1)*n*(n+1)*(n+2)*(2·n+1)/40. A112851

a(n) = 3·binomial(n+1,6). A253943

Maximal number of 165432 patterns in a permutation of 1,2,...,n. A100356

Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order. A122158