Properties of the Number 13481

Thirteen Thousand Four Hundred Eighty-One

Basics

Value: 13480 → 13481 → 13482

Parity: odd

Prime: No

Previous Prime: 13477

Next Prime: 13487

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 13 × 17 × 61

Divisors: 1, 13, 17, 61, 221, 793, 1037, 13481

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010010101001

Octal: 32251

Duodecimal: 7975

Hexadecimal: 34a9

Square: 181737361

Square Root: 116.1077086157504

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

Odd composite integers m such that A014448(m) == 4 (mod m). A335670

a(0)=1, a(1)=1, a(n) = 9·a(n/2) for even n >= 2, and a(n) = 8·a((n-1)/2) + a((n+1)/2) for odd n >= 3. A116526

Number of partitions of n containing m(4) as a part, where m denotes multiplicity. A240489

Numbers n such that n and n-1 are differences between 2 positive cubes in at least one way. A38595

Expansion of ∏_k>=1 (1 + x^k) * (1 + x^2·k) * (1 + x^3·k) * (1 + x^4·k) * (1 + x^5·k). A327047

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

For n>0, a(n) is the least quasi-Carmichael number to base n; a(0) = least composite squarefree integer. A29590

Numbers n such that sum of squares of digits of n equals the sum of prime divisors of n. A217390

G.f.: ∑_n>=0 xⁿ * (1+x)^n² / (1 + x*(1+x)ⁿ)ⁿ. A221546

Quasi-Carmichael numbers to base 6: squarefree composites n such that (n,2·3*5) = 1 and prime p∣n ==> p-6∣n-6. A29557