Properties of the Number 62964

Sixty-Two Thousand Nine Hundred Sixty-Four

Basics

Value: 62963 → 62964 → 62965

Parity: even

Prime: No

Previous Prime: 62939

Next Prime: 62969

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 11 × 53

Divisors: 1, 2, 3, 4, 6, 9, 11, 12, 18, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: Yes

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111010111110100

Octal: 172764

Duodecimal: 30530

Hexadecimal: f5f4

Square: 3964465296

Square Root: 250.9262839959178

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

Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives numbers belonging to cycles of length greater than 1. A99010

Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives numbers belonging to cycles, including fixed points. A164716

Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives least elements of each cycle, including fixed points. A164718

Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives least elements of each cycle of length > 1. A164720

Smallest member of cycle corresponding to n-th term of A151964. A151965

Iterate the Kaprekar map of A151949 starting at the n-digit number 100...02; sequence gives the lowest number in the resulting cycle. A151957

Iterate the Kaprekar map of A151949 starting at the n-digit number 100...01; sequence gives the lowest number in the resulting cycle. A151967

Triangle T(n,m) = ∑_k=0..m (-1)^m-k*binomial(m,k)*binomial(n-m+k-1,m-1)*binomial(2·n-3·m+k-1,n-m), T(n,n)=1. A271776

π in hexadecimal. A62964

Consider the Kaprekar map x->K(x) described in A151949. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n. A151959