Properties of the Number 12356

Twelve Thousand Three Hundred Fifty-Six

Basics

Value: 12355 → 12356 → 12357

Parity: even

Prime: No

Previous Prime: 12347

Next Prime: 12373

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 3089

Divisors: 1, 2, 4, 3089, 6178, 12356

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000001000100

Octal: 30104

Duodecimal: 7198

Hexadecimal: 3044

Square: 152670736

Square Root: 111.15754585272202

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

ATS: Add Then Sort (i.e., double previous term and then sort digits). A57615

T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A241283

Number of partitions of n where the difference between consecutive parts is at most 4. A238864

Triangle read by rows in which the n-th row contains the n numbers in increasing order formed by the concatenation of first n-1 numbers. (The digits of the numbers with 2 or more digits are taken as one entity.) First row is taken to be 0. A81539

Consider a number·as a concatenation of two integers, a and b: x = concat(a,b). Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves. A248134

a(n) is the concatenation of the positions of 1-bits in the binary expansion of the Gray code for n, when 1 is the rightmost position; a(0) = 0. A360287

Expansion of 1/(1 - x³ - x⁴ - x⁵ - x⁶ + x⁹). A225484

Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 4 central squares. A90164

Period (multiplicative order base 10) of the terms in A116074 and A116075. A116076

Has two properties: concatenation of its digits is same string as concatenation of digits of its first differences and every number appears exactly one of the sequence or its first differences. A139310