Properties of the Number -19431

Nineteen Thousand Four Hundred Thirty-One

Basics

Value: -19432 → -19431 → -19430

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 17 × 127

Divisors: 1, 3, 9, 17, 51, 127, 153, 381, 1143, 2159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101111100111

Octal: -45747

Duodecimal: -B2B3

Hexadecimal: -4be7

Square: 377563761

Square Root: 139.3951218658673

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

Almkvist-Zudilin numbers: ∑_k=0..n (-1)^n-k * ((3^n-3·k * (3·k)!) / (k!)³) * binomial(n,3·k) * binomial(n+k,k). A125143

Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n. A111036

Square array A(n,k) read by descending antidiagonals where A(n,k) is the k-th solution·to A328248(x) = n-1. A328250

Numbers of the form 110 + p². (where p is a prime). A138693

Nonnegative integers k such that the Chebyshev distance between the vector of proportions of the digits 0-9 in 2^k and the uniform distribution (1/10, ..., 1/10) sets a new minimum. A393333

T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157. A50161

T(n,k)=S(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array S as in A050157. A50164

Solutions to A096509[x]=6; number of prime-powers [including primes] in the neighborhood of·with Ceiling[Log[x]] radius equals 6. A96517