Properties of the Number -825265

Eight Hundred Twenty-Five Thousand Two Hundred Sixty-Five

Basics

Value: -825266 → -825265 → -825264

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 7 × 17 × 19 × 73

Divisors: 1, 5, 7, 17, 19, 35, 73, 85, 95, 119

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -11001001011110110001

Octal: -3113661

Duodecimal: -339701

Hexadecimal: -c97b1

Square: 681062320225

Square Root: 908.4409722155865

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

Least Carmichael number with n prime factors, or 0 if no such number exists. A6931

Carmichael numbers equal to the product of 5 primes. A112428

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

Carmichael numbers with more than 3 prime factors. A141711

a(n) = smallest pseudoprime to base 2 with n prime factors. A7011

Carmichael numbers ending in 5. A355305

Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181). A262043

a(n) is the smallest number m with n divisors d such that d^m mod m = d. A371513

Fermat pseudoprimes to base 2 divisible by 5. A216023

Square array A(n, k) read by antidiagonals downwards: smallest base-n Fermat pseudoprime with k distinct prime factors for k, n >= 2. A271873