Properties of the Number 32181

Thirty-Two Thousand One Hundred Eighty-One

Basics

Value: 32180 → 32181 → 32182

Parity: odd

Prime: No

Previous Prime: 32173

Next Prime: 32183

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 17 × 631

Divisors: 1, 3, 17, 51, 631, 1893, 10727, 32181

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110110110101

Octal: 76665

Duodecimal: 16759

Hexadecimal: 7db5

Square: 1035616761

Square Root: 179.39063520708098

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

Indices n where a run of primes begins in A376198. A376750

Indices n such that the 3 X 3 matrix with components (row by row) prime(n+k), 0 <= k <= 8, has zero determinant. A117345

a(0)=1, a(1)=3, a(n) = 4·a(n-1) + 3·a(n-2) for n > 1. A122558

Row sums of triangular table A138612. A166020

a(1) = 1, a(2) = 2. Thereafter, let smc and smp denote the smallest missing composite and smallest missing prime. If a(n) is composite, then if a(n) = 2·smp then a(n+1) = smp, otherwise a(n+1) = smc; if a(n) is a prime, then if smp < smc, a(n+1) = smp, otherwise a(n+1) = smc. A376198

Number of ways to partition n labeled elements into pie slices each of at least 2 elements. A32181

Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303012