Properties of the Number -36290

Thirty-Six Thousand Two Hundred Ninety

Basics

Value: -36291 → -36290 → -36289

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 19 × 191

Divisors: 1, 2, 5, 10, 19, 38, 95, 190, 191, 382

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000110111000010

Octal: -106702

Duodecimal: -19002

Hexadecimal: -8dc2

Square: 1316964100

Square Root: 190.49934383089092

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

Product of a prime and the previous number. A36689

Largest possible z-value of an integer solution (x,y,z) to 4/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z. The·and y components are in A075245 and A075246. A75247

a(n) = n*(n + 1)*(n² + n + 2)/4. A1621

Numbers m such that gcd(A001008(m), m) > 1, in increasing order. A256102

z-value of the lexicographically first solution (x,y,z) of 4/n = 1/x + 1/y + 1/z with 0 < x < y < z all integers, or 0 if there is no such solution. Corresponding·and y values are in A257839 and A257840. A257841

Numbers of the form 12·k + 2 with nonempty inverse totient set. A63668

Deficient oblong numbers. A77804

Oblong numbers n such that n - 1 and n + 1 are both semiprime. A276565

Numbers n such that 2 * (1ⁿ + 2ⁿ + 3ⁿ + ... + nⁿ) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n. A280187

a(0) = 1, a(n) = 28·n² + 2 for n>0. A10018