Properties of the Number 13341

Thirteen Thousand Three Hundred Forty-One

Basics

Value: 13340 → 13341 → 13342

Parity: odd

Prime: No

Previous Prime: 13339

Next Prime: 13367

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 4447

Divisors: 1, 3, 4447, 13341

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010000011101

Octal: 32035

Duodecimal: 7879

Hexadecimal: 341d

Square: 177982281

Square Root: 115.50324670761424

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

Positive numbers having the same set of digits in base 6 and base 10. A37437

Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A127289/A127290. A127297

G.f.: exp( ∑_n>=1 A119616(n)*xⁿ/n ) where A119616(n) = (σ(n)² - σ(n,2))/2. A201825

Numbers k such that the greatest prime divisor p of k²+1 has the property that (p - k)² + 1 = p. A206246

Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps. A246186

Intersection of A002061 and A016105. A370519

Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026714. A26724

Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 76. A31574

Least integer k such that the n-th prime of form m²+1 divides the composite number k²+1. A255675

E.g.f.: exp(sin(x)-log(x+1)). A13341