Properties of the Number 66012

Sixty-Six Thousand Twelve

Basics

Value: 66011 → 66012 → 66013

Parity: even

Prime: No

Previous Prime: 65993

Next Prime: 66029

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5501

Divisors: 1, 2, 3, 4, 6, 12, 5501, 11002, 16503, 22004

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000000111011100

Octal: 200734

Duodecimal: 32250

Hexadecimal: 101dc

Square: 4357584144

Square Root: 256.92800548013446

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

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1. A73

T(n,k)=Number of nXk binary arrays with every element equal to either the sum mod 2 of its vertical neighbors or the sum mod 2 of its horizontal neighbors. A183474

Number of simple graphs covering {1..n} with no crossing or nesting edges. A326329

Consider all quadruples {a,b,c,d} which reach {k,k,k,k} in n steps under map {a,b,c,d}->{|a-b|,|b-c|,|c-d|,|d-a|}; look at max{a,b,c,d}; sequence gives minimal value of this. A45794

Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t. A65678

Tribonacci sequences A000073 and A001590 interleaved. A213816

Number of partitions p of n such that (sum of parts with multiplicity 1) < (sum of all other parts). A240448

Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts). A240449

a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073. A73717

Trisection of tribonacci numbers. A99464