Properties of the Number 24095

Twenty-Four Thousand Ninety-Five

Basics

Value: 24094 → 24095 → 24096

Parity: odd

Prime: No

Previous Prime: 24091

Next Prime: 24097

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 61 × 79

Divisors: 1, 5, 61, 79, 305, 395, 4819, 24095

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111000011111

Octal: 57037

Duodecimal: 11B3B

Hexadecimal: 5e1f

Square: 580569025

Square Root: 155.22564221158822

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(n) is the number of reducible monic cubic polynomials x³ + r·x² + s·x + t with integer coefficients bounded by naïve height n (abs(r), abs(s), abs(t) <= n). A358398

Number of partitions of n with difference 7 between the number of odd parts and the number of even parts, both counted without multiplicity. A242698

Expansion of ∏_k>=1 (1 + x^k)^binomial(k+5,6). A344101

Number of n X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal. A224127

Number of n X 6 0..1 arrays with rows nondecreasing and antidiagonals unimodal. A224131

Number of 6 X n 0..1 arrays with rows nondecreasing and antidiagonals unimodal. A224137

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

T(n,k)=Number of nXk 0..1 arrays with rows nondecreasing and antidiagonals unimodal. A224133

a(n) = 8ⁿ - n⁷. A24095

Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 3 or 4 neighboring 1s. A297752