Properties of the Number 24461

Twenty-Four Thousand Four Hundred Sixty-One

Basics

Value: 24460 → 24461 → 24462

Parity: odd

Prime: No

Previous Prime: 24443

Next Prime: 24469

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 61 × 401

Divisors: 1, 61, 401, 24461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111110001101

Octal: 57615

Duodecimal: 121A5

Hexadecimal: 5f8d

Square: 598340521

Square Root: 156.40012787718558

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) = 25·n² - 36·n + 13. A154355

a(n) = (5·n + 1)² + 4·n + 1. A7533

Numerators of continued fraction convergents to sqrt(115). A41208

Number of A095282-primes in range ]2ⁿ,2ⁿ⁺¹]. A95292

Numbers k such that both k and k+2 are de Polignac numbers (A006285). A330284

Numbers k such that k and k+2 are both A000120-perfect numbers (A175522). A360639

Maximum possible number of subtrees of an n-node unrooted tree in which each node has maximum degree three (equivalently, rooted binary trees in which some internal nodes may have only one child). A subtree is a nonempty contiguous set of nodes, not necessarily including all descendants of the root. A124454

Number of ordered quadruples of integers from [ 2,n ] with no global factor. A15638

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (composite numbers). A24461