Properties of the Number 24885

Twenty-Four Thousand Eight Hundred Eighty-Five

Basics

Value: 24884 → 24885 → 24886

Parity: odd

Prime: No

Previous Prime: 24877

Next Prime: 24889

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 7 × 79

Divisors: 1, 3, 5, 7, 9, 15, 21, 35, 45, 63

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000100110101

Octal: 60465

Duodecimal: 12499

Hexadecimal: 6135

Square: 619263225

Square Root: 157.7498019016189

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

Odd primitive abundant numbers. A6038

Generalized Stirling number triangle of first kind read by rows: T(n, k) = [x^k] ∏_m=1..n (x - m - r), with r = 5. A51338

Number of ways to write n as an ordered sum of 7 squarefree numbers. A341067

Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors. A188439

Triangle read by rows giving numbers B(n,k) arising in the enumeration of doubly rooted tree maps. A260039

Number of integer partitions of n with at least two adjacent parts of quotient 2. A350846

The number of P-positions in the game of Nim with up to 5 piles, allowing for piles of zero, such that the number of objects in the largest pile is n. A241731

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

Odd recursive abundant numbers: odd numbers k such that A333926(k) > 2·k. A333950

Primitive terms of A388034. A388035