Properties of the Number 1967

One Thousand Nine Hundred Sixty-Seven

Basics

Value: 1966 → 1967 → 1968

Parity: odd

Prime: No

Previous Prime: 1951

Next Prime: 1973

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 281

Divisors: 1, 7, 281, 1967

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110101111

Octal: 3657

Duodecimal: 117B

Hexadecimal: 7af

Square: 3869089

Square Root: 44.35087372307337

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 integer partitions of n having a unique mode. A362608

a(n) = least k such that the remainder when 14^k is divided by k is n. A128154

G.f.: 1/p(x), where p(x) = degree 22 Salem polynomial p(x) = x²² + x²¹ - x¹⁹ - 2·x¹⁸ - 3·x¹⁷ - 3·x¹⁶ - 2·x¹⁵ + 2·x¹³ + 4·x¹² + 5·x¹¹ + 4·x¹⁰ + 2·x⁹ - 2·x⁷ - 3·x⁶ - 3·x⁵ - 2·x⁴ - x³ + x + 1. A143419

Number of compositions of n where differences between neighboring parts are in {-1,1}. A173258

a(n) = floor(n*φ¹⁰), where φ is the golden ratio, A001622. A4925

Numbers with exactly 9 ones in binary expansion. A23691

Descending dungeons: see Comments lines for definition. A121263

Least k such that the k-th maximal antirun of prime numbers > 3 has length n. Position of first appearance of n in A027833. The sequence ends if no such antirun exists. A373401

Least k such that there are exactly n multisets that can be obtained by choosing a divisor of each prime index of k. A355734

Concatenate n with n-th prime. A45532