Properties of the Number 13671

Thirteen Thousand Six Hundred Seventy-One

Basics

Value: 13670 → 13671 → 13672

Parity: odd

Prime: No

Previous Prime: 13669

Next Prime: 13679

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 ² × 31

Divisors: 1, 3, 7, 9, 21, 31, 49, 63, 93, 147

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11010101100111

Octal: 32547

Duodecimal: 7AB3

Hexadecimal: 3567

Square: 186896241

Square Root: 116.92305161943047

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(n) = σ(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341529

Number of partitions of n with no part larger than n/2. Also partitions of n into n/2 or fewer parts. A110618

a(n) = a(n-1) + a(n - 1 - number of even terms so far). A6336

a(n) = (2·n - 1)*(11·n² - 11·n + 6)/6. A63492

Number T(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A261836

Numbers n such that n!10 + 2 is prime. A204657

Numbers that are repdigits with length > 2 in more than one base. A167783

Positive numbers whose product of digits is 7 times their sum. A62384

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) is ∑_i=0..n (-1)^n-i*binomial(n,i)*∑_j=0..i binomial(i,j)^k. A328747

Numbers m such that β(m) = τ(m)/2 + 1 where β(m) is the number of Brazilian representations of m and τ(m) is the number of divisors of m. A326381