Properties of the Number 24901

Twenty-Four Thousand Nine Hundred One

Basics

Value: 24900 → 24901 → 24902

Parity: odd

Prime: No

Previous Prime: 24889

Next Prime: 24907

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 37 × 673

Divisors: 1, 37, 673, 24901

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000101000101

Octal: 60505

Duodecimal: 124B1

Hexadecimal: 6145

Square: 620059801

Square Root: 157.8005069700348

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

Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of partitions of kⁿ into powers of k. A145515

a(n) = ∑_{k=0..floor(n/6)} binomial(n-3k,3k). A100134

Lower level digraph derived from a voltage graph. A115055

Numbers which are the sum of two positive cubes and divisible by 37. A102618

Number of partitions of 7ⁿ into powers of 7, also equals the row sums of triangle A111830, which shifts columns left and up under matrix 7th power. A111832

a(n) = ∑_{k=0..floor(n/3)} binomial(2·n-3·k,3·k). A392402

a(n) = ∑_{k=0..floor(2·n/3)} binomial(3·k,2·n-3·k). A392432

a(n) is the number of regions formed by n-secting the angles of a decagon. A335800

a(n) = ∑_{k=0..floor(n/3)} binomial(n+3·k,n-3·k). A373905

a(n) = ∑_k=0..n binomial(3·k,3*(n-k)). A391902