Properties of the Number -153752

One Hundred Fifty-Three Thousand Seven Hundred Fifty-Two

Basics

Value: -153753 → -153752 → -153751

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 19219

Divisors: 1, 2, 4, 8, 19219, 38438, 76876, 153752

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100101100010011000

Octal: -454230

Duodecimal: -74B88

Hexadecimal: -25898

Square: 23639677504

Square Root: 392.1122288325117

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) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A234555

Expansion of (1/x) * Series_Reversion( x * (1 - x³ / (1 - x)²) ). A389348

Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A234550

Number of (n+1) X (4+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings). A234553

Triangle read by rows: T(n,k) is the number of numbers <= primorial(n) with k prime factors, counted without multiplicity. A292922