Properties of the Number -22736

Twenty-Two Thousand Seven Hundred Thirty-Six

Basics

Value: -22737 → -22736 → -22735

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 7 ² × 29

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 29, 49

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101100011010000

Octal: -54320

Duodecimal: -111A8

Hexadecimal: -58d0

Square: 516925696

Square Root: 150.78461459976612

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

a(n) = n²*(n+1). A11379

Expansion of g.f.: (1+x)/(1-28·x). A170748

T(n,k) is the number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors. A200886

T(n,k)=Number of nXk 0..6 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor. A203066

Numbers n such that sopf(σ(n)) = σ(sopf(n)), where sopf(x) = sum of the distinct prime factors of x. A76532

Numbers m such that the GCD of the x's that satisfy σ(x) = m is 3. A241648

a(n) = 29·n². A244635

Numbers n such that triangular number t(n) (see A000217) = n(n+1)/2 is a product of three consecutive integers. A97571

Numbers k such that sopfr(k + bigomega(k)) = sopfr(k). A187877

Non-cyclic numbers n such that φ(n)^φ(n) == gcd(n, φ(n)) (mod n), where φ is Euler totient function. A230919