Properties of the Number 32146

Thirty-Two Thousand One Hundred Forty-Six

Basics

Value: 32145 → 32146 → 32147

Parity: even

Prime: No

Previous Prime: 32143

Next Prime: 32159

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 16073

Divisors: 1, 2, 16073, 32146

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110110010010

Octal: 76622

Duodecimal: 1672A

Hexadecimal: 7d92

Square: 1033365316

Square Root: 179.2930561957155

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

a(0) = 1; for n > 0, a(n) = 41·n² + 2. A206399

a(n) = T(n,n), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 0. A26520

a(n) = T(n,n), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n)=0. A26537

a(n) = A026520(2n). A291088

a(1)=1, a(n+1) is the smallest number m such that A244448(a(n)) < A244448(m). A246628

First differences of A293230: how many more alive nodes there are in generation n+1 than in generation n in the binary tree of persistently squarefree numbers. A293440

Total binary weight squared of all A005251(n) binary sequences of length n not containing any isolated 1's. A332863

Numbers n such that σ(σ(φ(n))) = σ(σ(n)). A172466

Number of arrays of median of three adjacent elements of some length n+2 0..3 array, with no adjacent equal elements in the latter. A229007

Irregular triangle read by rows: T(n,m) = number of lattice paths of type {B^H}_R terminating at point (n, m). A291084