Properties of the Number -36650

Thirty-Six Thousand Six Hundred Fifty

Basics

Value: -36651 → -36650 → -36649

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 ² × 733

Divisors: 1, 2, 5, 10, 25, 50, 733, 1466, 3665, 7330

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000111100101010

Octal: -107452

Duodecimal: -19262

Hexadecimal: -8f2a

Square: 1343222500

Square Root: 191.44189719076647

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 integer partitions of n > 0 that are not the first sums of any composition with all parts > 1. A391620

Number of hybrid 10-ary trees with n internal nodes. A245053

Number of distinct sums of reciprocals of parts of partitions of n. A212187

Numbers n such that σ(Rev(φ(n))) = φ(Rev(σ(n))), where σ is the sum of divisors and φ the Euler totient function. A252255

Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime. A254541

Numbers of the form p² + q² = r³ + s³ with p, q, r, s primes. A283359

a(1) = 1; a(n+1) = ∑_d∣n σ(n/d)*a(d), where σ = sum of divisors (A000203). A307817

Number of permutations of [n] that avoid the shuffle pattern s-k-t, where s = 12 and t = 123. A324135