ℕ atory
Play Now

Properties of the Number 12205

Twelve Thousand Two Hundred Five

Basics

Value: 12204 → 12205 → 12206

Parity: odd

Prime: No

Previous Prime: 12203

Next Prime: 12211

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 5 × 2441

Divisors: 1, 5, 2441, 12205

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10111110101101

Octal: 27655

Duodecimal: 7091

Hexadecimal: 2fad

Square: 148962025

Square Root: 110.47624178980746

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

Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346520
Number A(n,k) of partitions of the (n+k)-multiset {1,2,...,n,1,2,...,k} into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346517
Array read by upwards antidiagonals: T(m,n) = number of set partitions into distinct parts of the multiset consisting of one copy each of x1, x2, ..., xm, and two copies each of y1, y2, ..., yn, for m >= 0, n >= 0. A322770
Base-7 Armstrong or narcissistic numbers, written in base 7. A10349
a(n) = (1/2)*(Bell(n+2)+Bell(n+1)-Bell(n)). A87648
G.f. A(x) satisfies: A(x) = (1/(1 - x)) * A(x2)2*A(x3)3*A(x4)4* ... *A(xk)k* ... A307604
Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x). A97155
Numbers n such that φ(n-1) + φ(n+1) = φ(2n). A67701
Table T(n,k) = sum over all set partitions of n of number at index k. A120057
Consider positive integer solutions to x3 + y3 = z3 - n or 'Fermat near misses' of 1, 2, 3 ... Arrange known solutions by increasing values of n. Sequence gives value of lowest z for a given n. A173515