Properties of the Number -218453

Two Hundred Eighteen Thousand Four Hundred Fifty-Three

Basics

Value: -218454 → -218453 → -218452

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 218453

Divisors: 1, 218453

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -110101010101010101

Octal: -652525

Duodecimal: -A6505

Hexadecimal: -35555

Square: 47721713209

Square Root: 467.38955914739904

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) is the index of F(n+1) at the unique occurrence of the ordered pair of reversed consecutive terms (F(n+1),F(n)) in Stern's diatomic sequence A002487, where F(k) denotes the k-th term of the Fibonacci sequence A000045. A86893

a(n) = 4·a(n-1) + 1 with a(0) = 3. A72197

An array A of the positive odd numbers, read by antidiagonals upwards, giving the present triangle T. A347834

Numbers k such that A081252(m)/m² has a local maximum for m = k. A81254

Odd numbers producing exactly 3 odd numbers in the Collatz (3x+1) iteration. A198584

a(n) = a(n-1) + 2·a(n-2), a(0)=2, a(1)=3. A48573

a(n) = 4·a(n-2) + 1 with a(1) = 0, a(2) = 3. A96773

Rectangular array with all start numbers Mo(n, k), k >= 1, for the Collatz operation ud^2·n-1, n >= 1, ending in an odd number, read by antidiagonals. A238476

Triangle read by rows: T(n,k) = number of squares and rectangles of area 2^k-1 after 2ⁿ stages in the toothpick structure of A139250, divided by 4, n>=1, k>=1, assuming the toothpicks have length 2. A211019

Locations of row maxima in "crushed" version of Stern's diatomic array. A169969