Properties of the Number 32764

Thirty-Two Thousand Seven Hundred Sixty-Four

Basics

Value: 32763 → 32764 → 32765

Parity: even

Prime: No

Previous Prime: 32749

Next Prime: 32771

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 8191

Divisors: 1, 2, 4, 8191, 16382, 32764

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111111111111100

Octal: 77774

Duodecimal: 16B64

Hexadecimal: 7ffc

Square: 1073479696

Square Root: 181.00828710310475

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(n) = 2ⁿ - 4. A28399

a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks. A347789

Numbers of the form q*(2^k), where q is one of the Mersenne primes (A000668) and k >= 0. A335431

Second diagonal under the main diagonal in A172119 written in a square (see comment). A173033

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 619", based on the 5-celled von Neumann neighborhood. A283353

Triangle read by rows: row n lists divisors of n-th perfect number A000396(n). A133031

Divisors of 33550336, the 5th perfect number. A133025

Triangle read by rows: T(n,k) is the number of 2-compositions of n having k columns with an even sum (0<=k<=floor(n/2)). A181327

Table read by rows, in which the n-th row lists all the primitive solutions k, in increasing order, such that k*σ(k) = A337875(n). A337876

Number of triangular partitions of n of order 4. A84446