Properties of the Number 66291

Sixty-Six Thousand Two Hundred Ninety-One

Basics

Value: 66290 → 66291 → 66292

Parity: odd

Prime: No

Previous Prime: 66271

Next Prime: 66293

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 19 × 1163

Divisors: 1, 3, 19, 57, 1163, 3489, 22097, 66291

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10000001011110011

Octal: 201363

Duodecimal: 32443

Hexadecimal: 102f3

Square: 4394496681

Square Root: 257.4703866466977

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..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250812

Numbers m with the property that its k-th smallest divisor, for all 1 <= k <= τ(m), contains exactly k "1" digits in its binary representation. A255401

Number of (n+1) X (4+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250808

Number of (5+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250817

Number of length 5 1..(n+1) arrays with every leading partial sum divisible by 2 or 3. A257067

Numbers m such that DivisorSigma(8·k-4, m) mod m = 0 holds presumably for all k; that is, (8·k-4)-power-sums of divisors of m are divisible by m for all k. A66291