Properties of the Number -22049

Twenty-Two Thousand Forty-Nine

Basics

Value: -22050 → -22049 → -22048

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 17 × 1297

Divisors: 1, 17, 1297, 22049

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101011000100001

Octal: -53041

Duodecimal: -10915

Hexadecimal: -5621

Square: 486158401

Square Root: 148.48905683584903

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 integer partitions of n with no adjacent parts having quotient > 2. A342094

Composites whose prime factorization in base 12 is an anagram of the number in base 12. A260055

Pseudoprimes to base 6. A5937

Odd composite integers m such that A006497(m) == 3 (mod m). A335669

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..3, with k running over the positive integers; square array, read by antidiagonals, downwards. A319061

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..4, with k running over the positive integers; square array, read by antidiagonals, downwards. A319062

Euler pseudoprimes to base 6: composite integers such that abs(6^{(n - 1}/2)) == 1 mod n. A262053

Numbers b > 1 such that the smallest four primes, i.e., 2, 3, 5 and 7 are base-b Wieferich primes. A339533

Numbers b > 1 such that the smallest five primes, i.e., 2, 3, 5, 7 and 11 are base-b Wieferich primes. A339534

a(n) = 18·n² - 1. A157910