Properties of the Number -19452

Nineteen Thousand Four Hundred Fifty-Two

Basics

Value: -19453 → -19452 → -19451

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 1621

Divisors: 1, 2, 3, 4, 6, 12, 1621, 3242, 4863, 6484

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100101111111100

Octal: -45774

Duodecimal: -B310

Hexadecimal: -4bfc

Square: 378380304

Square Root: 139.47042697288913

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) is the number of integers m which take n steps to reach 1 in '3x+1' problem. A5186

Number of integer partitions of n such that either the run-lengths or the negated run-lengths are unimodal. A332746

Expansion of ∏_k>=1 (1 + x^k²)²/(1 - x^k²)². A279227

Array read by antidiagonals: T(m,n) = number of irredundant sets in the lattice (rook) graph K_m X K_n. A290818

Number of free Tangles of size n. A333233

a(n) = (9·n⁴ + 4·n³ - n)/2. A47786

Number of (w,x,y,z) with all terms in {1,...,n} and |w-x| = 2*|x-y| - |y-z|. A212578

a(n) = A027113(n, n+3). A27116