Properties of the Number -131054

One Hundred Thirty-One Thousand Fifty-Four

Basics

Value: -131055 → -131054 → -131053

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 11 × 23 × 37

Divisors: 1, 2, 7, 11, 14, 22, 23, 37, 46, 74

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11111111111101110

Octal: -377756

Duodecimal: -63A12

Hexadecimal: -1ffee

Square: 17175150916

Square Root: 362.01381189120394

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

Eulerian numbers (Euler's triangle: column k=2 of A008292, column k=1 of A173018). A295

a(n) = 2ⁿ⁺¹ - n - 2, or partial sums of main diagonal of array A125127 of k-step Lucas numbers. A125128

Expansion of e.g.f. e^2x-(1+x)*e^x+x. A130103

Number of nonisomorphic unordered pairs of involutions on an n-set. A362649

G.f. satisfies A(x) = 1 + x⁴*A(x)*(1 + x·A(x)). A365727

Distinct elements occurring in triangle of Eulerian numbers (sorted). A30196

a(n) = ∑_k=0..n (1-(-1)^{floor( (-n-k}/2^k ) )) * 2^k-1. A105229

Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments. A352739

Number of (w,x,y,z) with all terms in {1,...,n} and |x-y|<|y-z|. A212681

Subsequence of A071395. The extra constraint is m is not a term if m·q/p is abundant where prime p∣m and q is the least prime larger than p. A333967