Properties of the Number 12200

Twelve Thousand Two Hundred

Basics

Value: 12199 → 12200 → 12201

Parity: even

Prime: No

Previous Prime: 12197

Next Prime: 12203

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 5 ² × 61

Divisors: 1, 2, 4, 5, 8, 10, 20, 25, 40, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10111110101000

Octal: 27650

Duodecimal: 7088

Hexadecimal: 2fa8

Square: 148840000

Square Root: 110.45361017187261

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

Multiples of 5 with digit sum 5. A69540

Numbers of rank 11 in the poset of lunar numbers. A191753

a(n) = (A278399(n)² + A278400(n)²)/2. A278420

Ternary numbers that are concatenated runs A(1)C(1)B(1)A(2)C(2)B(2)...A(k)C(k)B(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k. A371107

Product of n with sum of next n consecutive integers. A36659

Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero. A71154

Number of Dyck paths of semilength n having no DUDU's starting at level 1. A135339

Sum of the odd singletons in all partitions of n (n>=0). A singleton in a partition is a part that occurs exactly once. A276423

Irregular triangle read by rows: T(n,d) (n >= 1, d <= n-1 for n>1) = number of n X n integer-valued matrices M such that M_1,1=0, M_n,n=d, M_(i+1),j = M_i,j + (0 or 1), M_i,(j+1) = M_i,j + (0 or 1), and M_(i+1),(j+1) = M_i,j + (0 or 1). A323848

Glaisher's function G(n) (18 squares version). A2609