Properties of the Number -602069

Six Hundred Two Thousand Sixty-Nine

Basics

Value: -602070 → -602069 → -602068

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 13 × 29 × 1597

Divisors: 1, 13, 29, 377, 1597, 20761, 46313, 602069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -10010010111111010101

Octal: -2227725

Duodecimal: -250505

Hexadecimal: -92fd5

Square: 362487080761

Square Root: 775.9310536381438

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

a(n) = Fibonacci(n-1)² - Fibonacci(n)². A121646

a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 1,1,-2,-1. A111571

Number of n X 1 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 2,0,1,3,4 for x=0,1,2,3,4. A195971

a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045. A59840

a(n) = F(n)² - F(n-1)² or F(n+1) * F(n-2) where F(n) = A000045(n), the Fibonacci numbers. A226205

a(n) = 7·a(n-1) - a(n-2) + 4, with a(0) = 0, a(1) = 5. A3482

Positive values of k such that there is exactly one permutation p of (1,2,3,...,k) such that i+p(i) is a Fibonacci number for 1<=i<=k. A97083

a(n) = F(3)*F(n)*F(n+1) + F(4)*F(n+1)² - F(4) if n even, F(3)*F(n)*F(n+1) + F(4)*F(n+1)² if n odd, where F(n) is the n-th Fibonacci number (A000045). A80143

Numerator of ∑_k=1..n 1/(Fibonacci(k)*Fibonacci(k+2)). A119996

Numerators b(n) of Pythagorean approximations b(n)/a(n) to 1/2. A195548