Properties of the Number 6065

Six Thousand Sixty-Five

Basics

Value: 6064 → 6065 → 6066

Parity: odd

Prime: No

Previous Prime: 6053

Next Prime: 6067

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 1213

Divisors: 1, 5, 1213, 6065

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011110110001

Octal: 13661

Duodecimal: 3615

Hexadecimal: 17b1

Square: 36784225

Square Root: 77.87810988975015

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

Number of integer partitions of n whose first differences (assuming the last part is zero) are unimodal. A332283

Number of strict compositions of n with all adjacent parts (x, y) satisfying x < 2y and y < 2x. A342341

T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two. A248987

Positions of A080299 in A014486. A80298

Row/column pre-periods of Sprague-Grundy values of Wythoff's Game. A46874

a(n) = floor( n^π ). A61294

Number of permutations of length n which avoid the patterns 123, 3241. A116702

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + n - 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294548

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)*b(n), where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A296275

a(n) = ∑_k=1..n-1 k²*φ(k) + n²*φ(n)/2, where φ = A000010. A333293