Properties of the Number -29900

Twenty-Nine Thousand Nine Hundred

Basics

Value: -29901 → -29900 → -29899

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 ² × 13 × 23

Divisors: 1, 2, 4, 5, 10, 13, 20, 23, 25, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111010011001100

Octal: -72314

Duodecimal: -15378

Hexadecimal: -74cc

Square: 894010000

Square Root: 172.91616465790582

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) = 2·binomial(n,4). A34827

Lesser of amicable pair m < n defined by t(n) = m and t(m) = n where t(n) = ψ(n) - n and ψ(n) = A001615(n) is the Dedekind ψ function. A323329

a(n) = n*(n+1)*(11·n+1)/6. A132112

Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n). A88960

Imbalance of the number of parts of all partitions of n. A194796

Magic sums of 4 X 4 magic squares composed of odd squares. A271582

a(n) = n*(n + 1)*(n² + 17·n + 54)/24. A387204

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=2, k=-1 and l=0. A176856

Number of walks on cubic lattice. A5571