Properties of the Number 13395

Thirteen Thousand Three Hundred Ninety-Five

Basics

Value: 13394 → 13395 → 13396

Parity: odd

Prime: No

Previous Prime: 13381

Next Prime: 13397

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 19 × 47

Divisors: 1, 3, 5, 15, 19, 47, 57, 95, 141, 235

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11010001010011

Octal: 32123

Duodecimal: 7903

Hexadecimal: 3453

Square: 179426025

Square Root: 115.73677030226824

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 decimal digits in n-th Mersenne prime. A28335

21-gonal numbers: a(n) = n*(19n - 17)/2. A51873

A diagonal of A008296. A59302

x-values in the solution to 17·x² + 16 = y². A199774

Number of partitions p of n for which Odd(p) = Odd(p') (mod 4), where p' is the conjugate of p. A97566

Primitive elements of A119432. A119433

Squarefree numbers m such that the equation x*(x+1)*(x+2) = m·y² has more than one solution (x,y) with x>0 and y>0. A335715

a(1)=1, a(n+1) = a(n) + spf(∑_i=1..n a(i)), where spf=A020639 (smallest prime factor). A80180

a(1) = 1, a(2) = 2; a(n) = lcm(n, a(n-2)), a(n+1) = lcm((n+1), a(n-3)) and so on until a(2n-1) = lcm(2n-1, a(1)). Then a(2n) = lcm(2n, a(2n-2)) and so on. A109849

Base 8 palindromes that start with 3. A43023