Properties of the Number -22697

Twenty-Two Thousand Six Hundred Ninety-Seven

Basics

Value: -22698 → -22697 → -22696

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 22697

Divisors: 1, 22697

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101100010101001

Octal: -54251

Duodecimal: -11175

Hexadecimal: -58a9

Square: 515153809

Square Root: 150.65523555456014

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(0) = 1; for n>0, a(n) = smallest prime of the form k·a(n-1) + 1. A61092

Collatz (or 3x+1) trajectory starting at 10087. A161022

First primes of arithmetic progressions of 7 primes each with the common difference 210. A227282

Primes p such that prime(p)² - 2 = prime(q) for some prime q. A261354

Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows. A83809

Primes p such that 2·p³ -+ 3 are also prime. A174363

Number of odd singletons in all partitions of n (n>=0). A265257

Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code. A30504

a(n) = fⁿ (n), where f(n) is the smallest prime == 1 mod n (cf. A034694). A83810

Triangle read by rows: n-th row begins with n and contains n terms with the same prime signature such that the (r+1)-th term == 1 (mod r-th term). A113031