Properties of the Number 81936

Eighty-One Thousand Nine Hundred Thirty-Six

Basics

Value: 81935 → 81936 → 81937

Parity: even

Prime: No

Previous Prime: 81931

Next Prime: 81937

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 569

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10100000000010000

Octal: 240020

Duodecimal: 3B500

Hexadecimal: 14010

Square: 6713508096

Square Root: 286.2446506050375

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

Partial sums of A000337(n+4), n >= 0. A45618

The number of tilings of an equilateral triangle of side length n with k lozenges and n² - 2·k unit triangles. Triangle T(n, k) with n >= 1 and 0 <= k <= n*(n + 1)/2, read by rows. A273464

a(n) = 4*(n - 1)*(16·n - 23) for n >= 1. A304378

a(1)=6; a(n) is concatenation of the squares of each digit of a(n-1), in order (in base 10). A82027

Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases. A207047

Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 1 vertically. A207685

a(n) is the sum of all possible pairs of the first n primes. A162867

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 1 vertically. A207682

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases. A207050

The simple continued fraction expansion of F(x) := ∏_{n >= 0} (1 - x^4·n+3)/(1 - x^4·n+1) when x = (1/2)*(9 - sqrt(77)). A221367