Properties of the Number -130560

One Hundred Thirty Thousand Five Hundred Sixty

Basics

Value: -130561 → -130560 → -130559

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁹ × 3 × 5 × 17

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11111111000000000

Octal: -377000

Duodecimal: -63680

Hexadecimal: -1fe00

Square: 17045913600

Square Root: 361.33087330035886

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

Initial values for f(x)=φ(σ(x)) such that iteration of f ends in cycle of length=11. A96888

Triangle T(n,k) gives the number of ordered partitions of an n set into k odd-sized blocks. A196776

a(n) = 2ⁿ⁺²*(2ⁿ⁺¹-1). A59153

Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles. A57096

The number of length n binary words with some prefix which contains two more 1's than 0's or two more 0's than 1's. A233411

Number of primitive (aperiodic) palindromes using a maximum of two different symbols. A56458

a(n) = S1(n,2), where S1(n, t) = ∑_k=0..n (k^t * ∑_j=0..k binomial(n,j)). A89659

Number of reversible strings with n beads of 4 colors. If more than 1 bead, not palindromic. A32087

Number of bitstrings of length n (with at least two runs) where the last two runs have different lengths. A208901

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