Properties of the Number -252601

Two Hundred Fifty-Two Thousand Six Hundred One

Basics

Value: -252602 → -252601 → -252600

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 41 × 61 × 101

Divisors: 1, 41, 61, 101, 2501, 4141, 6161, 252601

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111101101010111001

Octal: -755271

Duodecimal: -102221

Hexadecimal: -3dab9

Square: 63807265201

Square Root: 502.5942697643896

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

Carmichael numbers: composite numbers k such that a^k-1 == 1 (mod k) for every a coprime to k. A2997

Strong pseudoprimes to base 2. A1262

3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p·q*r, where p < q < r are primes such that a^k-1 == 1 (mod k) if a is prime to k. A87788

Primary Carmichael numbers. A324316

Pseudoprimes to bases 2, 3 and 5. A83737

Least pseudoprime to base 2 through base prime(n). A83876

a(n) is the smallest Carmichael number (A002997) with the n-th prime as its smallest prime divisor, or 0 if no such number exists. A135720

Composite numbers n such that gcd(φ(n), n-1) = λ(n), where λ(n) = A002322(n). A264012

Frobenius pseudoprimes with respect to Fibonacci polynomial x² - x - 1. A212424

Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1. A94401