Properties of the Number -63260

Sixty-Three Thousand Two Hundred Sixty

Basics

Value: -63261 → -63260 → -63259

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 5 × 3163

Divisors: 1, 2, 4, 5, 10, 20, 3163, 6326, 12652, 15815

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1111011100011100

Octal: -173434

Duodecimal: -30738

Hexadecimal: -f71c

Square: 4001827600

Square Root: 251.51540708274712

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 n into relatively prime parts. Also aperiodic partitions. A837

-1 + number of partitions of n. A65

Number of integer partitions of n whose product of parts is not n. A379736

Number of integer partitions of n that cannot be partitioned into two or more blocks with equal sums. A321451

Number of partitions of n into parts all relatively prime to n. A57562

T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero. A199943

a(n) = A000041(n) - A032741(n). A167934

a(n) is the number of states that can be achieved when starting from n piles each containing one stone, where any number of stones can be transferred between piles that start with the same number of stones. A292726

Number of partitions of n into parts <= φ(n), where φ is Euler's totient function (cf. A000010). A227296

Number of partitions of n such that no part is a prime divisor of n. A237125