Properties of the Number -19594

Nineteen Thousand Five Hundred Ninety-Four

Basics

Value: -19595 → -19594 → -19593

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 97 × 101

Divisors: 1, 2, 97, 101, 194, 202, 9797, 19594

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100110010001010

Octal: -46212

Duodecimal: -B40A

Hexadecimal: -4c8a

Square: 383924836

Square Root: 139.97856978837868

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) = ∑_k=1..n (-3)^floor(n/k - 1). A345035

Number of semi-lone-child-avoiding locally disjoint rooted trees with n vertices. A331872

Sum of smallest parts (counted with multiplicity) of all partitions of n into odd parts. A92313

a(n) = 2·prime(n)*prime(n+1). A69486

Total number of even parts in the last section of the set of partitions of n. A206434

For every positive integer m, let u(m) = (d(1),d(2),...,d(k)) be the unitary divisors of m. The sequence (a(n)) consists of integers of the form d(k)/d(1) + d(k-1)/d(2) + ... + d(k)/d(1). A229999

a(n) = number of pairs {x,y} with (x,y > 1) such that x^y (= terms of A072103) has bit length n. A365930

Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UD and HH. A329676

a(n) = floor(3rd elementary symmetric function of ∑_j=1..k 1/j, k = 1,2,...,n). A25213

a(1) = 12; for n >= 2, a(n) = least positive integer of the form prime(m)*prime(n-m)*prime(n) with m >= 1. A364434