Properties of the Number 64607

Sixty-Four Thousand Six Hundred Seven

Basics

Value: 64606 → 64607 → 64608

Parity: odd

Prime: No

Previous Prime: 64601

Next Prime: 64609

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 23 × 53 ²

Divisors: 1, 23, 53, 1219, 2809, 64607

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111110001011111

Octal: 176137

Duodecimal: 3147B

Hexadecimal: fc5f

Square: 4174064449

Square Root: 254.17907073557413

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

T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors. A231839

Permutation of natural numbers: a(n) = A243283(A122111((2·n)-1)). A244984

Numbers k such that the odd part of (1+k) divides (1+A003961(k)), where A003961 is fully multiplicative with a(p) = nextprime(p). A387411

a(n) = Position of 2ⁿ among the numbers which are divisible by the square of their highest noncomposite factor (i.e., the union of {1} and A070003), 0 if not there. A244986

Records in A109734. A109739

2ⁿ+1 appears in A109732 at position a(n). A261414

Number of nX7 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors. A231838

Number of 2Xn 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors. A231840

Numbers k such that A064604(k) is divisible by k. A64607

a(1) = 1; for n > 1, a(n) is the smallest number not already present which is entailed by the rules (i) k present => 2k+1 present; (ii) 3k present => k present. A109732