Properties of the Number -69121

Sixty-Nine Thousand One Hundred Twenty-One

Basics

Value: -69122 → -69121 → -69120

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 ² × 409

Divisors: 1, 13, 169, 409, 5317, 69121

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10000111000000001

Octal: -207001

Duodecimal: -34001

Hexadecimal: -10e01

Square: 4777712641

Square Root: 262.90872941003687

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 regions among all distinct circles that can be constructed from n equally spaced points along a line using only a compass. A359253

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+239)² = y². A204765

L.g.f.: -log( ∑_n=-oo..+oo (-2)ⁿ * (2·x)^n² ) = ∑_n>=1 a(n) * xⁿ/n. A337950

a(n) = 21·n⁴ - 36·n³ + 25·n² - 8·n + 1. A239426

Positive numbers y such that y² is of the form x²+(x+409)² with integer x. A160577

Primitive solutions k to k² = u⁴ + v⁴ + w⁴, with u, v, w > 0. A365688

Integers k such that k² can be written as the sum of three positive fourth powers. A365657

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, -1, 1), (0, 1, -1), (1, 0, 0)}. A148712

Composite numbers k such that b^k == b (mod σ(k)) for every integer b. A277286