Properties of the Number -23675

Twenty-Three Thousand Six Hundred Seventy-Five

Basics

Value: -23676 → -23675 → -23674

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 ² × 947

Divisors: 1, 5, 25, 947, 4735, 23675

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101110001111011

Octal: -56173

Duodecimal: -1184B

Hexadecimal: -5c7b

Square: 560505625

Square Root: 153.86682553429117

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 (n+1)X(k+1) 0..2 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock equal. A236789

Number of tilings of an 8 X n rectangle using 2·n copies of the disconnected shape [oo__oo]. A323352

Number of paths from (0,0) to (n,0), with vertices (i,k) satisfying 0 <= k <= 3, consisting of segments given by the vectors (1,1), (1,2), (1,-1). A247323

Iterates of A122227, starting from A122227(5)=18. A122234

Number of (n+1)X(3+1) 0..2 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock equal. A236784

Expansion of x*(x³+2·x²+3·x-1)/(x+1)⁵. A119515

Number of (n+1) X (n+1) 0..2 arrays with the upper median plus the lower median minus the minimum of every 2 X 2 subblock equal. A236781