Properties of the Number 32460

Thirty-Two Thousand Four Hundred Sixty

Basics

Value: 32459 → 32460 → 32461

Parity: even

Prime: No

Previous Prime: 32443

Next Prime: 32467

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 × 541

Divisors: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111111011001100

Octal: 77314

Duodecimal: 16950

Hexadecimal: 7ecc

Square: 1053651600

Square Root: 180.16658957753515

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

Number T(n,k) of defective (binary) heaps on n elements with k defects; triangle T(n,k), n>=0, 0<=k<=max(0,n-1), read by rows. A306343

Number of defective (binary) heaps on n elements with exactly one defect. A323957

T(n, k) = [x^k] n! [tⁿ] 1/(exp((V*(2 - 2·t + V))/(4·t))*sqrt(1 + V)) where V = W(-2·t*x) and W denotes the Lambert function. Table read by rows, T(n, k) for 0 <= k <= n. A343807

Structured pentagonal icositetrahedral numbers (vertex structure 10). A100168

a(n) = 36·n² + 2·n. A158064

A290865(n) -(n-1). A290876

Number of defective (binary) heaps on n elements with exactly eight defects. A323964

Number of increasing sequences of n integers x(1),...,x(n) with values in 1..2·n such that x(j) divides x(k) if j divides k. A180384

Number of length-n 0..7 arrays with no repeated value differing from the previous repeated value by one. A269493

Number of length-5 0..n arrays with no repeated value differing from the previous repeated value by one. A269496