Properties of the Number -55222

Fifty-Five Thousand Two Hundred Twenty-Two

Basics

Value: -55223 → -55222 → -55221

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 27611

Divisors: 1, 2, 27611, 55222

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1101011110110110

Octal: -153666

Duodecimal: -27B5A

Hexadecimal: -d7b6

Square: 3049469284

Square Root: 234.99361693458826

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

Lexicographically earliest sequence of increasing numbers whose digits satisfy the "Fractal Jump" rule using only the digits 2 and 5: keep the first digit "d" of the sequence, then jump over the next "d" digits and keep the digit "e" on which you have landed. Jump now over the next "e" digits and keep the digit "f" on which you have landed, etc. The succession "def..." of kept digits is the sequence itself. A105647

a(n) = ∑_k=1..n φ(k)*φ(k+1)*φ(k+2), where φ(k) = A000010(k) is Euler's totient function. A335131

Semiprimes (A001358) made of nontrivial runs of identical digits. A116063

Triangle read by rows: T(n,k) = 3·T(n-1,k-1) + 3·T(n-1,k) - 2·T(n-2,k-1) with T(n,0) = T(n,n) = 1. A152613

Number of 7-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero and first and second differences in -n..n. A208974

Self-conjugate digitized partition numbers. A68325

Table read by rows: T(n, k) is the number of permutations of size n whose incidence graph has treewidth k. A368500