Properties of the Number 13775

Thirteen Thousand Seven Hundred Seventy-Five

Basics

Value: 13774 → 13775 → 13776

Parity: odd

Prime: No

Previous Prime: 13763

Next Prime: 13781

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 ² × 19 × 29

Divisors: 1, 5, 19, 25, 29, 95, 145, 475, 551, 725

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010111001111

Octal: 32717

Duodecimal: 7B7B

Hexadecimal: 35cf

Square: 189750625

Square Root: 117.36694594305503

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

a(0) = 1, a(1) = 5, a(n) = 4·a(n-1) - a(n-2). A1834

a(2·n) = a(2·n-1) + a(2·n-2), a(2·n+1) = 2·a(2·n) + a(2·n-1); a(0) = a(1) = 1. A2531

Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1. A6145

Number of integer partitions of n whose Heinz number (product of primes of parts) is divisible by their sum of primes of parts. A330953

Rectangular array read by (upward) antidiagonals: A(n,k) = ∑_j=0..k (-1)^floor(j/2)*binomial(k-floor((j+1)/2), floor(j/2))*n^k-j, n >= 1, k >= 0. A294099

Limit of the sequence obtained from S(0) = (1,1) and, for n > 0, S(n) = I(S(n-1)), where I consists of inserting, for i = 1, 2, 3..., the term a(i) + a(i+1) between any two terms for which 7·a(i+1) <= 11·a(i). A82630

Sum of prime divisors of n (with repetition) is one less than the sum of prime divisors (with repetition) of n+1. A228126

Related to Bernoulli numbers. A2316

S₁₁ sequence in partition of integers > 1 described in A240521. A241024

Magic sums of 4 X 4 magic squares composed of squares. A271580