Properties of the Number -24255

Twenty-Four Thousand Two Hundred Fifty-Five

Basics

Value: -24256 → -24255 → -24254

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 7 ² × 11

Divisors: 1, 3, 5, 7, 9, 11, 15, 21, 33, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -101111010111111

Octal: -57277

Duodecimal: -12053

Hexadecimal: -5ebf

Square: 588305025

Square Root: 155.74016822900893

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

Triangle of signed numbers used for the computation of the column sequences of triangle A090217. A90435

Number T(n,k) of set partitions of [n] with minimal block length multiplicity equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A271424

Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = 1. A380889

Number of ways to write n as an ordered sum of 5 nonprime numbers. A341482

Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}. A147577

a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_i+1^e_i·Product p_i+3^e_i. A45973

Nonnegative values·of solutions (x, y) to the Diophantine equation x²+(x+857)² = y². A129857

Total number of palindromic primes in base 9 below 9ⁿ. A117787

Numerators of triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the coefficient of x^2k+1 in polynomial u_n(x), used to approximate x->sin(π*x)/π. A144846

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