ℕ atory
Play Now

Properties of the Number 6032

Six Thousand Thirty-Two

Basics

Value: 6031 → 6032 → 6033

Parity: even

Prime: No

Previous Prime: 6029

Next Prime: 6037

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 4 × 13 × 29

Divisors: 1, 2, 4, 8, 13, 16, 26, 29, 52, 58

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1011110010000

Octal: 13620

Duodecimal: 35A8

Hexadecimal: 1790

Square: 36385024

Square Root: 77.6659513557904

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

Expansion of ∑k>=0 xk2+k/((1-x)(1-x2)...(1-x2k)). A122134
Number of palindromic partitions of n with greatest part of multiplicity 2. A238779
G.f.: (1+x8+x9+x10+x18)/((1-x2)*(1-x3)*(1-x4)*(1-x5)*(1-x6)*(1-x7)). A97851
Rectangular table, read by antidiagonals, such that the o.g.f. of row n, Rn(y), satisfies: Rn(y) = ∑k>=0 yk * Rk(y)n for n>=0, with R0(y) = 1/(1-y). A124460
Number A(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order; square array A(n,k), n>=0, k>=0, read by antidiagonals. A261835
T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals. A203355
Row 4 of rectangular table A124460. A124464
Number of representations of n as a sum of products of distinct pairs of positive integers, n = ∑k=1..m ik*jk with ik<=jk, ik<=ik+1, jk<=jk+1, ik*jk<ik+1*jk+1. A212216
Numbers which are representable as a sum of thirteen but no fewer consecutive nonnegative integers. A270300
a(1) = 1, a(2) = 0; for n > 2, a(n) = n·Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1). A6490