Properties of the Number 23956

Twenty-Three Thousand Nine Hundred Fifty-Six

Basics

Value: 23955 → 23956 → 23957

Parity: even

Prime: No

Previous Prime: 23929

Next Prime: 23957

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 53 × 113

Divisors: 1, 2, 4, 53, 106, 113, 212, 226, 452, 5989

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110110010100

Octal: 56624

Duodecimal: 11A44

Hexadecimal: 5d94

Square: 573889936

Square Root: 154.77725931156684

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

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 2,1,3,4,0 for x=0,1,2,3,4. A196957

Diagonal sums of number triangle A109970. A109972

Apparently solves the identity: Find sequence A that represents the numbers of ordered compositions of n into the elements of the set {B}; and vice versa. A224341

a(1) = 1, a(2) = 2, a(3) = 2, a(4) = 3, for n >= 3, a(n+2) = a(n+1) + a(n)*floor(n/2)*ceiling(n/2). A98738

Number of n X 5 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 2,1,3,4,0 for x=0,1,2,3,4. A196954

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 878", based on the 5-celled von Neumann neighborhood. A273741

Numbers k such that A055228(k)² - A055228(k) is a multiple of k, where A055228(k) is ceiling(sqrt(k!)). A306014

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (-1, 1, 1), (0, 0, -1), (1, 0, 1)}. A149144

Triangle read by rows: T(n,m) = binomial(n, m) + floor(Eulerian(n + 1, m)/2). A174035

Number of n X n 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 2,1,3,4,0 for x=0,1,2,3,4. A196951