Properties of the Number -64079

Sixty-Four Thousand Seventy-Nine

Basics

Value: -64080 → -64079 → -64078

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 139 × 461

Divisors: 1, 139, 461, 64079

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1111101001001111

Octal: -175117

Duodecimal: -310BB

Hexadecimal: -fa4f

Square: 4106118241

Square Root: 253.13830211961206

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

Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1). A61084

Shifts left two places under BIN1 transform. A52341

Lucas numbers beginning at 2: L(n) = L(n-1) + L(n-2), L(0) = 2, L(1) = 1. A32

Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3. A204

Bisection of Lucas sequence: a(n) = L(2·n+1). A2878

a(n) = floor(φⁿ), where φ = (1+sqrt(5))/2 is the golden ratio. A14217

Associated Mersenne numbers. A1350

Round φⁿ to the nearest integer. A169985

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264