Properties of the Number 2350

Two Thousand Three Hundred Fifty

Basics

Value: 2349 → 2350 → 2351

Parity: even

Prime: No

Previous Prime: 2347

Next Prime: 2351

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 ² × 47

Divisors: 1, 2, 5, 10, 25, 47, 50, 94, 235, 470

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100100101110

Octal: 4456

Duodecimal: 143A

Hexadecimal: 92e

Square: 5522500

Square Root: 48.47679857416329

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) = n*(n+3). A28552

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 5 as largest digit. A256631

Numbers m such that there are precisely 10 groups of order m. A249553

a(n) = 3·n² - 2. A100536

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 1 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 1 3 6 or 7. A252305

Number of integer partitions of n with more parts than distinct divisors of parts. A371171

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0. A264945

Number of heptagons that can be formed with perimeter n. A288253

Sum of smallest parts of all partitions of n into distinct parts. A92265

T(n,k) = Number of n X k 0..4 arrays with each element equal to the number of its horizontal and vertical neighbors within one of itself. A196017