Properties of the Number 67330

Sixty-Seven Thousand Three Hundred Thirty

Basics

Value: 67329 → 67330 → 67331

Parity: even

Prime: No

Previous Prime: 67307

Next Prime: 67339

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 6733

Divisors: 1, 2, 5, 10, 6733, 13466, 33665, 67330

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000011100000010

Octal: 203402

Duodecimal: 32B6A

Hexadecimal: 10702

Square: 4533328900

Square Root: 259.4802497301095

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock summing to less than 6. A184673

Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j³+k³, ordered by increasing i; sequence gives j values. A54206

Number of (n+1)X3 0..3 arrays with no 2X2 subblock summing to less than 6. A184666

Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically. A207759

Number of 7Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically. A207767

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

Number of (n+1)X(n+1) 0..3 arrays with no 2X2 subblock summing to less than 6. A184664

Triangle read by rows of incomplete convolutions of Fibonacci numbers F(n+1) = A000045(n+1), n>=0. A67330

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically. A207762

Table read by antidiagonals: T(n, k) is the sum of the numbers inside the k-th square of size n X n when the square spiral is tiled with these squares, where each tile contains numbers which sum to the minimum possible value, and each number on the spiral can only be in one tile. A341363