Properties of the Number -131062

One Hundred Thirty-One Thousand Sixty-Two

Basics

Value: -131063 → -131062 → -131061

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 19 × 3449

Divisors: 1, 2, 19, 38, 3449, 6898, 65531, 131062

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11111111111110110

Octal: -377766

Duodecimal: -63A1A

Hexadecimal: -1fff6

Square: 17177247844

Square Root: 362.02486102476445

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) = ∑_d∣n σ(n/d)*d⁴. A27848

Residues of 3^{2^(p(n}-1)+1) for Mersenne numbers with prime indices. A131460

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 565", based on the 5-celled von Neumann neighborhood. A289402

a(n) = 2ⁿ - 10. A246168

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

a(-1) = 1, a(n) = ∑_k=0..n A034851(n,k)*a(k-1) where A034851(n,k) are entries in Losanitsch's triangle. A102814

a(n) = (-1/2)*∑_{i1 + i2 + i3 = 2·n} ((2·n)!/(i1! i2! i3!))*B(i1), where B are the Bernoulli numbers (with i1, i2, i3 >= 1). A124133