Properties of the Number 63004

Sixty-Three Thousand Four

Basics

Value: 63003 → 63004 → 63005

Parity: even

Prime: No

Previous Prime: 62989

Next Prime: 63029

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 19 × 829

Divisors: 1, 2, 4, 19, 38, 76, 829, 1658, 3316, 15751

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011000011100

Octal: 173034

Duodecimal: 30564

Hexadecimal: f61c

Square: 3969504016

Square Root: 251.00597602447635

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) = ∑_k=0..7 binomial(n,k). A8860

a(n) = 2^2·n+1 - C(2·n+3,n+1) + C(2·n+1,n). A6419

Triangle read by rows: T(n,k) is the number of rooted planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1. A342981

Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= ∑_j=0..n T(n-j,k-1)*binomial(2j+1,j+1). A90285

Number of valleys at level 0 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights). A191389

a(n) = ∑_k=0..n binomial(3·n-3,k). A385823

Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/2). A187926

Convolution of (1, p(1), p(2), ...) and (F(2), F(3), F(4), ...). A23628

Difference between 2ⁿ and the next larger or equal power of 3. A63004