Properties of the Number -132352

One Hundred Thirty-Two Thousand Three Hundred Fifty-Two

Basics

Value: -132353 → -132352 → -132351

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁸ × 11 × 47

Divisors: 1, 2, 4, 8, 11, 16, 22, 32, 44, 47

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100000010100000000

Octal: -402400

Duodecimal: -64714

Hexadecimal: -20500

Square: 17517051904

Square Root: 363.80214402886634

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

Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive step pattern up, down, up, down; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-3)/2)), read by rows. A230797

a(n) = 2^n-1*(2ⁿ+5). A256873

a(n) = ∑_{k=0..floor(n/3)} 2^k * binomial(2·k,2·n-6·k). A387763

Table by antidiagonals of T(n,k) = 2·n*T(n,k-1) - n²*T(n,k-2) + T(n,k-4) starting with T(n,1) = 1. A73135

Number of permutations of [n] with exactly one occurrence of the consecutive step pattern up, down, up, down. A230832

Number of permutations of [n] having two cycles of the form (c1, c2, ..., c_m) where c1 = min_i>=1 c_i and c_j = min_i>=j c_i or c_j = max_i>=j c_i. A346317

Number of symmetric and correlation-immune Boolean functions of n variables. A210571