Properties of the Number -15223

Fifteen Thousand Two Hundred Twenty-Three

Basics

Value: -15224 → -15223 → -15222

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 13 × 1171

Divisors: 1, 13, 1171, 15223

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101101110111

Octal: -35567

Duodecimal: -8987

Hexadecimal: -3b77

Square: 231739729

Square Root: 123.3815221173738

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

a(0) = 1, a(1) = 2; for n>=2 a(n) is the number of degree-n reducible polynomials over GF(2). A58766

a(n) = 8·n² - 6·n - 1. A194431

Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers. A84276

Odd composite numbers n, such that n, n+d, n·d and n/d are all odious (A000069) for every divisor d of n. A231558

Triangle read by rows: T(n,k) is the total number of humps with height k in all Motzkin paths of order n, n >= 2 and 1 <= k <= n/2. A379838

a(n) = 1·t(n) + 2·t(n-1) + ... + k·t(n+1-k), where k=floor((n+1)/2) and t is A000201 (lower Wythoff sequence). A23866

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

Number of partitions of n where each part is a power of a factor of n. A326486

a(n) = (n³ + 6·n² + 17·n + 6)/6. A341209