Properties of the Number 64705

Sixty-Four Thousand Seven Hundred Five

Basics

Value: 64704 → 64705 → 64706

Parity: odd

Prime: No

Previous Prime: 64693

Next Prime: 64709

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 12941

Divisors: 1, 5, 12941, 64705

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111110011000001

Octal: 176301

Duodecimal: 31541

Hexadecimal: fcc1

Square: 4186737025

Square Root: 254.37177516383377

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

Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(5,n) (with n at least 4) missing three edges, where all three removed edges are incident to different vertices in the 5-point set but exactly two removed edges are incident to the same vertex in the other set. A342327

T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any diagonal or antidiagonal neighbor, and containing the value n(n+1)/2-k-1. A211963

Numbers that are palindromic in base i-1. A342725

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, 0, 1), (1, 1, -1)}. A148584

Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any diagonal or antidiagonal neighbor, and containing the value n(n+1)/2-4. A211960

Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(4,n) (with n at least 4) missing three edges, where exactly two of the removed edges are incident to the same vertex in the 4-point set but none of the removed edges are incident to the same vertex in the other set. A340437

a(n) = smallest number k such that five consecutive prime numbers prime(n), prime(n+1), prime(n+2), prime(n+3) and prime(n+4) are divisors of k, k+1, k+2, k+3, and k+4 respectively. A180100

Maximal number of vectors u₁, u₂, ... in Rⁿ with |u_i| = 1 and |u_i - u_j| >= 1 for i, j distinct, where || is L1-norm. A64705