Properties of the Number -262134

Two Hundred Sixty-Two Thousand One Hundred Thirty-Four

Basics

Value: -262135 → -262134 → -262133

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 14563

Divisors: 1, 2, 3, 6, 9, 18, 14563, 29126, 43689, 87378

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111111111111110110

Octal: -777766

Duodecimal: -107846

Hexadecimal: -3fff6

Square: 68714233956

Square Root: 511.990234281866

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

Numbers k such that 2^k == 10 (mod k). A128123

Rectangular array A read by upward antidiagonals in which the entry in row n and column k is defined by A(n,k) = (2^a(n)*(6·k - (3 - (-1)^a(n))*(1 - (-1)ⁿ)/2) - 2ⁿ + 4)/6, n,k >= 1, where {a(n)} is the Beatty sequence A117630 defined by a(n) = floor(n·log(3)/log(3/2)). A254312

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood. A286118

a(n) = largest multiple of n which is <= 2ⁿ. A128092

a(n) = the largest positive multiple of n with exactly n digits when written in binary. A162214

Monotonic ordering of nonnegative differences 4ⁱ-10^j, for 40>=i>=0, j>=0. A192171

Expansion of o.g.f. x*(1 - x + x²)/(1 -3·x +x² +3·x³ -2·x⁴). A173009

a(n) = 2ⁿ - 10. A246168

a(n) = 2ⁿ - floor((n+3)/2). A320933

2^n-1 - (prime(n) mod n). A77686