Properties of the Number -22500

Twenty-Two Thousand Five Hundred

Basics

Value: -22501 → -22500 → -22499

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 ⁴

Divisors: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101011111100100

Octal: -53744

Duodecimal: -11030

Hexadecimal: -57e4

Square: 506250000

Square Root: 150

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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

Exponential abundant numbers: integers k for which A126164(k) > k, or equivalently for which A051377(k) > 2k. A129575

Numbers n such that n¹⁰²⁴ + 1 is prime (a generalized Fermat prime). A57002

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n as ∑_k=0..n T(n,k)*binomial(n,k). A244130

Triangle read by rows: terms T(n,k) of a binomial decomposition of n as Sum(k=0..n)T(n,k). A244131

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n*(n-1) as Sum(k=0..n)T(n,k)*binomial(n,k). A244138

a(n) = ∏_j=0..5 floor((n+j)/6). A8881

a(n) = (5·n)². A16850

a(n) = (11·n + 7)². A17474

a(n) = prime(n)*prime(n-1) + 1. A23523

Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=10. A135195