Properties of the Number -28575

Twenty-Eight Thousand Five Hundred Seventy-Five

Basics

Value: -28576 → -28575 → -28574

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 ² × 127

Divisors: 1, 3, 5, 9, 15, 25, 45, 75, 127, 225

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110111110011111

Octal: -67637

Duodecimal: -14653

Hexadecimal: -6f9f

Square: 816530625

Square Root: 169.04141504376966

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

Numbers k such that k and 3·k are anagrams. A23087

Number of ways to write n as the arithmetic mean of a set of distinct primes. A72701

a(n) = ∑_d∣n σ(n/d)*d⁴. A27848

a(n) = ∑_d∣n d⁴*A000593(n/d). A288420

Sums of distinct powers of 13. A33049

Least sum of a set of n odious numbers (A000069) such that the sum of two or more is an evil number (A001969). A230387

Numbers k such that k*(k+1)-1 and k*(k+1)+1 are twin primes and k*(k+3)-1 and k*(k+3)+1 are also twin primes. A138303

a(n) = (n⁴ + 2·n³ - n²)/2. A255499

Numbers n such that 4·10ⁿ + 5·R_n - 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n. A102991

Maximal value of GCD of 2 distinct n-digit numbers using the same digits. A126687