Properties of the Number 27774

Twenty-Seven Thousand Seven Hundred Seventy-Four

Basics

Value: 27773 → 27774 → 27775

Parity: even

Prime: No

Previous Prime: 27773

Next Prime: 27779

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 1543

Divisors: 1, 2, 3, 6, 9, 18, 1543, 3086, 4629, 9258

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110001111110

Octal: 66176

Duodecimal: 140A6

Hexadecimal: 6c7e

Square: 771395076

Square Root: 166.6553329479738

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 totally transitive rooted trees with n nodes. A318185

Number of ways to write n as an ordered sum of 9 primes. A340965

Riordan array (f(x),x·f(x)) where f(x) is the g.f. of A117641. A171224

Floor[ concatenation of n+3, n+2, n+1 and n divided by 4 ]. A75005

a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n). A96460

Triangle T(n,k) read by rows: left edge is 0, 1, 2, ... (cf. A001477); otherwise each entry is sum of entry to left and entries immediately above it to left and right, with 1 for the missing right term at right edge. A224791

Number of (n+1) X (6+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101. A259220

Number of pairs (λ,μ) of partitions λ of n and μ of four with μ <= λ (by diagram containment). A303854

T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101. A259222

a(n) = (n+1)*binomial(n+1,14). A27774