Properties of the Number -31825

Thirty-One Thousand Eight Hundred Twenty-Five

Basics

Value: -31826 → -31825 → -31824

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 ² × 19 × 67

Divisors: 1, 5, 19, 25, 67, 95, 335, 475, 1273, 1675

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111110001010001

Octal: -76121

Duodecimal: -16501

Hexadecimal: -7c51

Square: 1012830625

Square Root: 178.39562774911272

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

Numbers n such that A242719(n) = (prime(n))²+1 and A242720(n) - A242719(n) = 2*(prime(n)+1). A246748

Numbers n for which there are exactly six k such that n = k + (product of nonzero digits of k). A96927

Let S denote the palindromes in the language {0,1,2,...,n-1}*; a(n) = number of words of length 4 in the language SS. A187277

Expansion of ∑_k>=0 (x/(1 - x))^k³. A280351

Numerators of continued fraction convergents to sqrt(789). A42520

Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 10). A212390

a(n) = ∑_{k=0..floor(4·n/11)} binomial(k+3,4·n-11·k). A390041

Equals two maps: number of 2 X n binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..1 2 X n array. A220407

a(n) is the smallest b > 1 such that bⁿ - (b-1)ⁿ has all divisors d == 1 (mod n). A321576