Properties of the Number 13760

Thirteen Thousand Seven Hundred Sixty

Basics

Value: 13759 → 13760 → 13761

Parity: even

Prime: No

Previous Prime: 13759

Next Prime: 13763

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁶ × 5 × 43

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010111000000

Octal: 32700

Duodecimal: 7B68

Hexadecimal: 35c0

Square: 189337600

Square Root: 117.30302638892144

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

Numbers k for which 8·R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k. A96508

5 times pentagonal numbers: 5·n*(3·n-1)/2. A152734

Numbers h such that 2^φ(h) == φ(h) (mod h). A292544

G.f. B(x) satisfies: ∑_n>=0 (-1)ⁿ * n * (B(x) - (-1)ⁿ*B(-x))ⁿ = 0. A318641

a(n) = (k+1)*n + k*(k+1)/2, where k = A332542(n). A332544

a(n) = ∑_{k=0..floor(2·n/5)} binomial(2·k+1,2·n-5·k). A392455

Total number of interior nodes in all series-parallel networks with n labeled edges, multiple edges allowed. A58480

Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached). A81851

Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of semilength n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k UUU's (U=(1,1)). A191518

Expansion of φ(x) * χ(x²)⁴ in powers of·where φ(), χ() are Ramanujan θ functions. A260514