Properties of the Number 24270

Twenty-Four Thousand Two Hundred Seventy

Basics

Value: 24269 → 24270 → 24271

Parity: even

Prime: No

Previous Prime: 24251

Next Prime: 24281

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 809

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 809, 1618

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101111011001110

Octal: 57316

Duodecimal: 12066

Hexadecimal: 5ece

Square: 589032900

Square Root: 155.78831791889917

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

Cototient of the n-th primorial number. A53144

Square array A(n,k): number of integers having k or more factors less than prime(n+1) in their prime factorization, within any interval of primorial(n)^k positive integers. A281891

Nonnegative integers n such that in balanced ternary representation the number of occurrences of each trit doubles when n is squared. A257867

Lower Wythoff values for sequence A185615(n). A185616

Numbers k such that k² +/- (k-1) and (k-1)*k² +/- 1 are all primes. A239326

Triangle T(n,k) = ((-1)^n+k/(n+1))*∑_j=0..n (-1)^j*j!*Stirling2(n, j)* binomial(n-j, k)*binomial(n+j, j), read by rows. A156653

Number of (6+2)X(n+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order. A252967

Triangle of coefficients of quasi-Stirling polynomials. A331998

a(n) is the smallest k such that the following are four primes: prime(n)*k-1, prime(n)*k+1, prime(n)*k²-1, prime(n)*k²+1. Or -1 if no such k exists. A266239

T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order. A252961