Properties of the Number 65730

Sixty-Five Thousand Seven Hundred Thirty

Basics

Value: 65729 → 65730 → 65731

Parity: even

Prime: No

Previous Prime: 65729

Next Prime: 65731

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 7 × 313

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10000000011000010

Octal: 200302

Duodecimal: 32056

Hexadecimal: 100c2

Square: 4320432900

Square Root: 256.378626254218

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 k such that k⁶ + 82991 is prime. A126893

Numbers k having exactly 5 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 5 distinct prime factors). A115959

Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument. A328762

A089450 indexed by A000040. A89525

Numbers with exactly 5 distinct prime factors each of which is a palindrome. A46403

Triangle read by rows. T(n, k) = ∑_j=k..n binomial(n, j) * (-j)^{n - j} * (-1)^{j - k}* A360177(j, k). A360176

a(n) = A050314(2n+1,1): column 1 of triangle. A50316

a(n) = floor(C(2n,n)/2ⁿ⁺¹). A24504

Number of two-sided n-step prudent walks ending on the top side or the right side of their boxes, avoiding two consecutive west steps and south steps. A190795

Triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes with exactly k vertices whose unique descendent is a leaf, n >= 1, 0 <= k <= floor((n-1)/2) + delta_2,n. A284417