Properties of the Number 63075

Sixty-Three Thousand Seventy-Five

Basics

Value: 63074 → 63075 → 63076

Parity: odd

Prime: No

Previous Prime: 63073

Next Prime: 63079

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 29 ²

Divisors: 1, 3, 5, 15, 25, 29, 75, 87, 145, 435

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 1111011001100011

Octal: 173143

Duodecimal: 30603

Hexadecimal: f663

Square: 3978455625

Square Root: 251.1473670974872

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

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

Integers j not of form 3m+2 such that for any integer k > 0, j·10^k+1 has a divisor in the set { 7, 11, 13, 37 }. A243969

G.f.: ∏_k>=1 1/(1-x^k)^3·k+1. A255271

a(n) is the sum over all partitions of n of the number of right angles that are not the largest right angle. A330378

Numbers k such that σ(reverse(k)) = σ(reverse(k-1)) + σ(reverse(k-2)). A69970

Number of length n+7 0..2 arrays with at most one downstep in every n consecutive neighbor pairs. A255114

T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs. A255107

Number of partitions of 2n² whose Ferrers-plot fits within a 2n X 2n box and cover an n X n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right and passing through the center. A63075