Properties of the Number 24490

Twenty-Four Thousand Four Hundred Ninety

Basics

Value: 24489 → 24490 → 24491

Parity: even

Prime: No

Previous Prime: 24481

Next Prime: 24499

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 31 × 79

Divisors: 1, 2, 5, 10, 31, 62, 79, 155, 158, 310

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111110101010

Octal: 57652

Duodecimal: 1220A

Hexadecimal: 5faa

Square: 599760100

Square Root: 156.49281133649558

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 nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4. A240284

Number of integer partitions of n that are empty, or have smallest part dividing all the others, but do not have greatest part divisible by all the others. A343345

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A280810

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of vertices in the resulting planar graph. A367302

Consecutive states of the linear congruential pseudo-random number generator (10924·s+11830) mod (2¹⁵+1) when started at s=1. A384150

Trajectory of 3 under map n->7n+1 if n odd, n->n/2 if n even. A37101

Consider a number of k digits n = d_k*10^k-1 + d_k-1*10^k-2 + … + d₂*10 + d₁. Sequence lists the numbers n such that φ(n) = ∑_i=1..k-1{σ(∑_j=1..i{d_j*10^j-1})} (see example below). A240897

Numbers m such that m²+1 is prime with (m-1)²+1 and (m+1)²+1 semiprimes. A321795

Numbers which when multiplied by any repunit prime Rp give a Smith number. A104167

Number of -n..n arrays x(0..3) of 4 elements with zero sum and elements alternately strictly increasing and strictly decreasing. A200058