Properties of the Number 65167

Sixty-Five Thousand One Hundred Sixty-Seven

Basics

Value: 65166 → 65167 → 65168

Parity: odd

Prime: Yes

Previous Prime: 65147

Next Prime: 65171

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 65167

Divisors: 1, 65167

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111010001111

Octal: 177217

Duodecimal: 31867

Hexadecimal: fe8f

Square: 4246737889

Square Root: 255.27827953039795

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

Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4,2,6]; short d-string notation of pattern = [426]. A78850

Signature-permutation of a Catalan automorphism, row 65167 of A089840. A129609

Let p_3,1(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_3,1(m) such that the interval(p_3,1(m)*n, p_3,1(m+1)*n) contains exactly one prime == 1(mod 3). A210465

Primes p such that the differences between the 5 consecutive primes starting with p are (4,2,6,4). A78953

Primes p such that p + 4, p + 12 and p + 16 are also primes. A384298

Numbers k such that k + (largest digit of k)! is a palindromic prime. A95920

Number of (k+1)-tuples of integers modulo n (x₁,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),... A98966

Signature permutations of non-recursive Catalan automorphisms (i.e., bijections of finite plane binary trees, with no unlimited recursion down to indefinite distances from the root), sorted according to the minimum number of opening nodes needed in their defining clauses. A89840

Signature permutations of ENIPS-transformations of non-recursive Catalan automorphisms in table A089840. A122204

Signature-permutation of a Catalan Automorphism: Rotate non-crossing chords (handshake) arrangements; rotate the root position of general trees as encoded by A014486. A57501