Properties of the Number 12513

Twelve Thousand Five Hundred Thirteen

Basics

Value: 12512 → 12513 → 12514

Parity: odd

Prime: No

Previous Prime: 12511

Next Prime: 12517

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 43 × 97

Divisors: 1, 3, 43, 97, 129, 291, 4171, 12513

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000011100001

Octal: 30341

Duodecimal: 72A9

Hexadecimal: 30e1

Square: 156575169

Square Root: 111.86152153444007

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) = (3·n+1)*(4·n+1). A33577

Consecutive states of the linear congruential pseudo-random number generator for 16-bit WATFOR/WATFIV when started at 1. A384158

Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n. A201922

Partial sums of the sum of the 5th powers of the divisors of n: ∑_i=1..n sigma₅(i). A248076

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = ∑_j=1..n j^k * floor(n/j). A319649

a(n) = ∑_k=0..n-1 binomial(4·k,k) * binomial(4·n-4·k,n-k-1). A386611

Maximum value taken on by f(P) = ∑_i=1..n p(i)*p(n+1-i) as {p(1),p(2),...,p(n)} ranges over all permutations P of {1,2,3,...,n}. A87035

a(1)=1. a(n) = a(n-1) + sum of the triangular numbers which are among the first (n-1) terms of the sequence. A100963

Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right. A297627

Numbers of the form prime(w)*prime(x)*prime(y) with w >= x >= y such that 2w = 3x + 4y. A358102