Properties of the Number -336567

Three Hundred Thirty-Six Thousand Five Hundred Sixty-Seven

Basics

Value: -336568 → -336567 → -336566

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 11 × 31 × 47

Divisors: 1, 3, 7, 11, 21, 31, 33, 47, 77, 93

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010010001010110111

Octal: -1221267

Duodecimal: -142933

Hexadecimal: -522b7

Square: 113277345489

Square Root: 580.143947654373

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 permutations satisfying -k <= p(i) - i <= r and p(i) - i not in I, i=1..n, with k=1, r=5, I={1,3}. A79962

a(n) = sigma₂(n)*Fibonacci(n), where sigma₂(n) = A001157(n), the sum of squares of divisors of n. A203849

a(n) appears in the congruences modulo 4 or 32 of Markoff numbers m(n) = A002559(n) for odd or even m(n). A309376

a(n) = floor(Fibonacci(n)/4). A4697

a(n+3) = 3·a(n+2) + 5·a(n+1) + a(n), a(0) = 0, a(1) = 1, a(2) = 3. A110526

a(n) = (Fibonacci(6·n+1) - 1)/4. A49661

a(n) = a(n-1) + a(n-2) + 1 if n is a multiple of 6, otherwise a(n) = a(n-1) + a(n-2). A131132

Number of (n+1) X (4+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101. A259218

a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/4|. A293553