Properties of the Number 13774

Thirteen Thousand Seven Hundred Seventy-Four

Basics

Value: 13773 → 13774 → 13775

Parity: even

Prime: No

Previous Prime: 13763

Next Prime: 13781

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 71 × 97

Divisors: 1, 2, 71, 97, 142, 194, 6887, 13774

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010111001110

Octal: 32716

Duodecimal: 7B7A

Hexadecimal: 35ce

Square: 189723076

Square Root: 117.36268572250722

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 (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0001 0101 or 0111. A259297

Number of distinct products of subsets of integers in the interval [n²+1, (n+1)²-1] which are twice a square. A99500

Start with a(0) = 0; then a(n) = smallest number > a(n-1) such that a(n) divides concat(a(n), a(n-1), ..., a(0)). A250746

a(n) = number of triangles with integer sides i <= j <= k with radius of circumcircle <= n. A331229

Numerators of continued fraction convergents to sqrt(340). A41642

a(n) = 2·prime(n)² - 4. A153480

Number of (n+1) X (2+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0001 0101 or 0111. A259291

Number of (n+1)X(6+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0001 0101 or 0111. A259295

Cycles of rooted trees t where for each t all subtrees at root are distinct. n is total number of nodes. A52817

Sum of distinct orders of degree-n even permutations. A60180