Properties of the Number 12695

Twelve Thousand Six Hundred Ninety-Five

Basics

Value: 12694 → 12695 → 12696

Parity: odd

Prime: No

Previous Prime: 12689

Next Prime: 12697

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 2539

Divisors: 1, 5, 2539, 12695

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000110010111

Octal: 30627

Duodecimal: 741B

Hexadecimal: 3197

Square: 161163025

Square Root: 112.67209059922514

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) = ∑_{1 <= i, j <= n} gcd(i, j, n)³. A368743

a(n) = n³ + n² - 1. A3777

G.f.: A(x,y) = exp( ∑_n>=1 [∑_k=0..n C(n,k)⁶ * y^k] * xⁿ/n ) = ∑_n>=0,k=0..n T(n,k)*xⁿ*y^k, as a triangle of coefficients T(n,k) read by rows. A218116

a(n) = 24·n² - 1. A158544

Constant term in the reduction of the polynomial (x+3)ⁿ by x² -> x+1. A192240

Numbers n such that the sum of the sum-of-divisors function of all integers up to n is a square. A130698

a(n) = 529·n - 1. A158365

Number of binary words of length n with exactly 8 (possibly overlapping) occurrences of the subword given by the binary expansion of n. A236237

Least j > 1 for n > 0 such that j² = (n² + 1)*(k²) + (n² + 1)*k + 1 where k sequence = A106230. A106229

A109507(10ⁿ). A109508