Properties of the Number -8295

Two Hundred Ninety-Five

Basics

Value: -8296 → -8295 → -8294

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 79

Divisors: 1, 3, 5, 7, 15, 21, 35, 79, 105, 237

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10000001100111

Octal: -20147

Duodecimal: -4973

Hexadecimal: -2067

Square: 68807025

Square Root: 91.0768905925098

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 times prime(n) occurs as the least prime factor among numbers 1 .. prime(n)³: a(n) = A078898(A030078(n)). A250474

Expansion of e.g.f. exp(x² / 2) / (1 - x). A130905

Base-9 Armstrong or narcissistic numbers (written in base 10). A10353

21-gonal numbers: a(n) = n*(19n - 17)/2. A51873

T(n,k)=Rolling icosahedron face footprints: number of nXk 0..19 arrays starting with 0 where 0..19 label faces of an icosahedron and every array movement to a horizontal, diagonal or antidiagonal neighbor moves across an icosahedral edge. A223282

a(n) = (3·n+1)*(4·n+1). A33577

Base 9 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-9 digits, for some k. A162234

Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n}, having exactly k blocks consisting only odd entries (0<=k<=ceiling(n/2)). A124420

Partial sums of A365412. A365442

Number of paths in Moebius ladder M_n. A20874