Properties of the Number 13735

Thirteen Thousand Seven Hundred Thirty-Five

Basics

Value: 13734 → 13735 → 13736

Parity: odd

Prime: No

Previous Prime: 13729

Next Prime: 13751

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 41 × 67

Divisors: 1, 5, 41, 67, 205, 335, 2747, 13735

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010110100111

Octal: 32647

Duodecimal: 7B47

Hexadecimal: 35a7

Square: 188650225

Square Root: 117.19641632746284

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..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250812

First of two sequences bisecting the second differences of the partition numbers (see A053445). A160644

Number of weighted lattice paths of weight n having no (1,0)-steps of weight 1. A182883

Chebyshev pseudoprimes to base 2: composite numbers k such that T(k, 2) == 2 (mod k), where T(k, x) is the k-th Chebyshev polynomial of the first kind. A330206

Odd composite integers m such that U(m)² == 1 (mod m) and V(m) == 4 (mod m), where U(m)=A001353(m) and V(m)=A003500(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=4 and b=1, respectively. A337778

a(n) = ∑_{p in P} binomial(H(2,p),2), where P is the set of partitions of n, and H(2,p) = number of hooks of size 2 in p. A301313

a(1) = 1; for n > 1, a(n) is the smallest unused positive number such that sopfr(|a(n) - a(n-1)|) = sopfr(a(n) + a(n-1)) and ω(|a(n) - a(n-1)|) = ω(a(n) + a(n-1)), where sopfr(k) is the sum of the primes dividing k, with repetition. A370503

The smallest positive number such that sopfr(|a(n) - n|) = sopfr(a(n) + n) and ω(|a(n) - n|) = ω(a(n) + n), where sopfr(k) is the sum of the primes dividing k, with repetition. A370504

Number of strings of numbers x(i=1..6) in 0..n with sum i²*x(i)² equal to n²*36. A184244

Number of (n+1) X (2+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250806