Properties of the Number -19366

Nineteen Thousand Three Hundred Sixty-Six

Basics

Value: -19367 → -19366 → -19365

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 23 × 421

Divisors: 1, 2, 23, 46, 421, 842, 9683, 19366

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100101110100110

Octal: -45646

Duodecimal: -B25A

Hexadecimal: -4ba6

Square: 375041956

Square Root: 139.1617763611833

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 of partitions of 3n into exactly 5 parts. A256314

Number of partitions of 2n into exactly 5 parts. A256309

Number of partitions of 4n into exactly 5 parts. A256316

Number of arrangements of 3 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero. A190072

Partial sums of the second power of arithmetic derivative function A003415. A231864

Number of partitions of n into parts that contain primes to odd powers only (A002035). A290369

a(n) is the smallest number k such that A275235(k) = n. A354840

Number of even parts in the partitions of n into 9 parts. A309658

Successive records of function f(x) = log(abs(π(x) - R(x)))/log(x) where π(x) is the number of primes <= x and R(x) is Riemann's prime counting function. A353055

Triangular array read by rows: T(n,k) = the number of closed meanders with n top arches and k closed meanders in the reduction of the closed meander by the reverse of the exterior arch splitting algorithm. A363910