Properties of the Number 4250

Four Thousand Two Hundred Fifty

Basics

Value: 4249 → 4250 → 4251

Parity: even

Prime: No

Previous Prime: 4243

Next Prime: 4253

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 ³ × 17

Divisors: 1, 2, 5, 10, 17, 25, 34, 50, 85, 125

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000010011010

Octal: 10232

Duodecimal: 2562

Hexadecimal: 109a

Square: 18062500

Square Root: 65.19202405202648

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

Monotonic ordering of set S generated by these rules: if·and y are in S then x² + y² is in S, and 1 is in S. A192476

First term of n-th difference sequence of (floor(k·r)), r = sqrt(2), k >= 0. A325664

Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n² can be written as a sum of two squares in 10 ways. A97225

Numbers whose multiset of prime factors is separable but has no alternating permutation. A345173

Numbers k such that k | 13^k + 1. A15963

Integers whose squares are the sums of 24 consecutive squares. A180274

T(n,k) = Number of n X k 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A280398

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 1,0 2,1 or -1,-1. A264476

Let u be any string of n digits from {0,...,5}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-6 number; then a(n) = max_u f(u). A65847

Perimeter of primitive integer-sided triangles with A < B < C < 2*π/3 and such that FA + FB + FC is an integer where F is the Fermat point of the triangle. A336333