Properties of the Number 32067

Thirty-Two Thousand Sixty-Seven

Basics

Value: 32066 → 32067 → 32068

Parity: odd

Prime: No

Previous Prime: 32063

Next Prime: 32069

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 509

Divisors: 1, 3, 7, 9, 21, 63, 509, 1527, 3563, 4581

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111110101000011

Octal: 76503

Duodecimal: 16683

Hexadecimal: 7d43

Square: 1028292489

Square Root: 179.07261097108068

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) is the number of imprimitive (periodic) 2n-bead balanced binary necklaces. A386946

Number of (3+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically. A258556

Numbers of the form 26+p² (where p is a prime). A138689

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, 1), (1, -1, 1), (1, 0, -1)}. A149032

a(n) is the number of coverings of 1..n by cyclic words of length n, such that each value from 1 to n appears precisely 3 times. That is, the union of all the letters in all of the words of a given covering is the multiset {1,1,1,2,2,2,...,n,n,n}. Repeats of words are not allowed in a given covering. A110105

Shifts left 2 places under "BGK" (reversible, element, unlabeled) transform. A32067

Number of 4Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself. A265994