Properties of the Number 12705

Twelve Thousand Seven Hundred Five

Basics

Value: 12704 → 12705 → 12706

Parity: odd

Prime: No

Previous Prime: 12703

Next Prime: 12713

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 11 ²

Divisors: 1, 3, 5, 7, 11, 15, 21, 33, 35, 55

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000110100001

Octal: 30641

Duodecimal: 7429

Hexadecimal: 31a1

Square: 161417025

Square Root: 112.71645842555559

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 abundant numbers (odd numbers m whose sum of divisors exceeds 2m). A5231

Numbers n such that n = product (p_k)^c_k and set of its (c_k k's)'s is a self-conjugate partition, where p_k is k-th prime and c_k > 0. A88902

Odd primitive abundant numbers. A6038

Numbers n for which nontrivial positive magic squares of exactly 10 different orders with magic sum n exist. For a definition of nontrivial positive magic squares, see A125005. A125017

Number of edge-rooted tree-like octagonal systems. A36758

a(n) = least k such that 2ik + 1 is prime for all 1 <= i <= n. A71576

26-gonal numbers: a(n) = n*(12·n-11). A255185

Numbers k such that A276086(k) is a multiple of k. A328387

Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = ∏_j=1..n ∏_i=1..j-1 ( 1 - (m+1)*(i+1) ) and m = 3, read by rows. A156692

Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}. A147577