Properties of the Number -22352

Twenty-Two Thousand Three Hundred Fifty-Two

Basics

Value: -22353 → -22352 → -22351

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 11 × 127

Divisors: 1, 2, 4, 8, 11, 16, 22, 44, 88, 127

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101011101010000

Octal: -53520

Duodecimal: -10B28

Hexadecimal: -5750

Square: 499611904

Square Root: 149.50585272824605

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

Expansion of e.g.f. log(1+x)/exp(sinh(x)). A9437

a(n) = -(8·a(n-4)*a(n-1) - 57·a(n-3)*a(n-2))/a(n-5) with initial values -1, 0, 1, -1, -8, 57, 455. A241595

Hexagonal pyramidal numbers, or greengrocer's numbers. A2412

Numbers k such that 10^k + 13 is prime. A95688

Array read by rows: T(n,k) is the number of directed multigraphs with loops with n arcs, k vertices, and no vertex of degree 0. A136564

Numbers k such that (2^k - k - 1)*2^k + 1 is prime. A201362

Number of partitions of n into 6 or more distinct parts. A347573

Number of series-parallel networks with n unlabeled edges, multiple edges not allowed. A58387

a(n) = 4·a(n-1) - 4·a(n-2) + 2·a(n-4), with a(0)=a(1)=a(2)=0, and a(3)=1. A135248

a(n) = floor(log₁₀(1/error(n))), where error(n) is the error in the n-th iteration of the Salamin-Brent algorithm for computing π. A276778