Properties of the Number 24153

Twenty-Four Thousand One Hundred Fifty-Three

Basics

Value: 24152 → 24153 → 24154

Parity: odd

Prime: No

Previous Prime: 24151

Next Prime: 24169

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 83 × 97

Divisors: 1, 3, 83, 97, 249, 291, 8051, 24153

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111001011001

Octal: 57131

Duodecimal: 11B89

Hexadecimal: 5e59

Square: 583367409

Square Root: 155.4123547212383

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) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2. A264313

Fixed points of the function A260529(n) = concatenation of the positions of digits 9, 8,..., 0 in the decimal representation of n, using 1 for the rightmost digit etc., skipping digits which don't occur. A260275

Numbers n which divide A260521(n), the concatenation of the positions of the digits 9, 8, ..., 0 in the decimal representation of n, where positions are counted from the right, and 0 if a given digit does not occur. A260386

Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic residues mod p that are > p/2. A282040

Decimal encoding T(n,k) of the k-th non-averaging permutation of [n]; triangle T(n,k), n >= 0, k = 1..A003407(n), read by rows. A292523

Diagonal of the triangle A354700. A354701

Number of permutations of length n avoiding the permutations 13452, 13542, 14253, 14352, 14532, 15243, 15342, 15432, 24153, and 25143. A366706

Number of (n+1)X(6+1) arrays of permutations of 0..n·7+6 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2. A264311

Number of (2+1)X(n+1) arrays of permutations of 0..n·3+2 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2. A264315

Derangements of {1,2,...,n} (n >= 2) in lexicographic order. A320588