Properties of the Number -22790

Twenty-Two Thousand Seven Hundred Ninety

Basics

Value: -22791 → -22790 → -22789

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 43 × 53

Divisors: 1, 2, 5, 10, 43, 53, 86, 106, 215, 265

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101100100000110

Octal: -54406

Duodecimal: -11232

Hexadecimal: -5906

Square: 519384100

Square Root: 150.96357176484665

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

Number of locally nonintersecting rooted trees with n nodes. A317787

a(n) is the number of integer partitions of n for which the smallest part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight. A318196

Shifts left under XOR-convolution: a(n) = ∑_k=0..n-1 a(k) XOR a(n-k-1) for n>1 with a(0)=1, a(1)=2. A192484

If a Fibonacci sequence is formed with first term = number of digits in n and second term = sum of decimal digits in n, then n itself occurs as a term in the sequence after the first two terms. A38868

G.f. A(x) satisfies: 1 = ∏_n>=1 (1 - xⁿ) * (1 - xⁿ⁺¹/A(x)) * (1 - x^n-2*A(x)). A268651

Number of separable partitions of n that consist of an even number of parts. A325723

Numbers k such that (Sum of totatives of k) == 1 (mod Sum of primes dividing k with multiplicity). A340299