Properties of the Number -131052

One Hundred Thirty-One Thousand Fifty-Two

Basics

Value: -131053 → -131052 → -131051

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 67 × 163

Divisors: 1, 2, 3, 4, 6, 12, 67, 134, 163, 201

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11111111111101100

Octal: -377754

Duodecimal: -63A10

Hexadecimal: -1ffec

Square: 17174626704

Square Root: 362.0110495551206

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

Beginning of a run of 4 consecutive Niven (or Harshad) numbers. A141769

a(n) = initial term of the smallest tuple of exactly n consecutive Harshad numbers. A60159

Starts of runs of 5 consecutive Niven (or harshad) numbers (A005349). A330928

Number of digits in the decimal expansion of the number of partitions of 7ⁿ. A248735

If an array is made of columns of -nacci sequences (Fibonacci, tribonacci, etc.), all starting with 1,1,2,..., the NW-to-SE diagonals can be extended by computation. This sequence is diagonal 6. See A159741 for details. A159742

Number of irreducible permutations of n with partition type [2, 1, 1, ..., 1] (with '1' taken n - 2 times). A356114

McKay-Thompson series of class 28a for Monster. A58610

Fibonacci 14-step numbers, a(n) = a(n-1) + a(n-2) + ... + a(n-14). A220469