Properties of the Number -156156

One Hundred Fifty-Six Thousand One Hundred Fifty-Six

Basics

Value: -156157 → -156156 → -156155

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 7 × 11 × 13 ²

Divisors: 1, 2, 3, 4, 6, 7, 11, 12, 13, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100110000111111100

Octal: -460774

Duodecimal: -76450

Hexadecimal: -261fc

Square: 24384696336

Square Root: 395.16578799283724

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) = binomial(2·n,n) * (2·n+1)². A294486

Number of closed walks of length n on the Petersen graph rooted at a given vertex. A91000

a(n) = lcm(n², swinging_factorial(n)). A181860

Number of factorization patterns of polynomials of degree n over F₄. A6169

Numbers k such that k + the sum of the fourth powers of its digits is again a fourth power. A362954

Number of set partitions of {1,...,n} with largest set of size 10. A229252

Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,47. A64260

Triangle T(n,k), 0 <= k <= n, defined by : T(n,k) = 0 if k < 0, T(0,k) = 0^k, (n+2)*(2·n-2·k+1)*T(n,k) = (2·n+1)*( 4*(2·n-2·k+1)*T(n-1,k-1) + (n+2·k+2)*T(n-1,k) ). A123382

Number of arrays of 5 integers in -n..n with sum zero and the sum of every adjacent pair being odd. A202077

Number of (n+4)X7 0..2 matrices with each 5X5 subblock idempotent. A224620

We use cookies

Some cookies are essential for Natory to function, like keeping you signed in. We also use optional cookies to understand how the app is used and improve it over time. Learn more in our Privacy Policy. You can manage your preferences anytime.